The range of a finite non empty set of n real numbers s is defined as the difference between the largest and smallest elements of s. for each representation of s given below, describe in english an algorithm to compute the range. indi- cate the time efficiency classes of these algorithms using the most appropriate notation (o, big theta, or big omega ).

a. anunsortedarray
b. a sorted array
c. a sorted singly linked list

d. a binary search tree

Which is a false statement considering copyright law? a. when people upload something to the internet they automatically receive a copyright for the work b. the work does not have to contain a copyright notice to be considered having a copyright c. copyright is legal term describing rights given to the creators for literary and artistic works d. personal pictures are always covered by copyrights

If your accelerator suddenly gets stuck what should you do

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