The range of a finite nonempty set of n real numbers S is defined as the difference betw...

The range of a finite nonempty 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. Indicate the time efficiency classes of these algorithms using the most appropriate notation

a. An unsorted array

b. A sorted array

c. A sorted singly linked list

d. A binary search tree