S c) Describe the average-case performance of the linear search algorithm in Figure 1 in terms of the average number of comparisons used, assuming that the integer x is not in the list. Use step by step calculations. ALGORITHM 2 The Linear Search Algorithm. procedure linear searchx: integer, a. a....d distinct integers) while (in and xa) if in then location:=i else location:=0 return location location is the subscript of the term that equals x, or is 0 if x is not found) Figure 1: Linear Search Algorithm