Suppose that the equal_lists function (page 49 of sebesta) is called with the lists (a (b) (c)) and(a (b) (c)) as the arguments.
(a) what will be the return value of the function?
(b)draw the recursion tree as we did in class. how many total calls of equal_lists will be performed, including the original call and all recursive call

Which of the statements below is true? the formatting, standard, and drawing commands are unavailable. the formatting, standard, and drawing commands have been used. the formatting, standard, and drawing toolbars are displayed. the formatting, standard, and drawing toolbars are hidden.

Simon says is a memory game where "simon" outputs a sequence of 10 characters (r, g, b, y) and the user must repeat the sequence. create a for loop that compares the two strings starting from index 0. for each match, add one point to userscore. upon a mismatch, exit the loop using a break statement. assume simonpattern and userpattern are always the same length. ex: the following patterns yield a userscore of 4: simonpattern: rrgbryybgy userpattern: rrgbbrybgy

There’s only one game mode that stars with the letter ‘e’ in cs: go. which of the options below is it?