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