Problem 2: Search an Array Considering the search problem, we have a list of n integers A = (v1, v2, · ·· Vn). We want to design an algorithm to check whether an item v exists or not such that it...

Extracted text: Problem 2: Search an Array Considering the search problem, we have a list of n integers A = (v1, v2, · ·· Vn). We want to design an algorithm to check whether an item v exists or not such that it should return either the index, i, if it was found or -1 otherwise, when not found. a) Implement the algo hm in Python b Empirically, show the performance curve of the algorithm using time measurements. c Using the basics of the theoretical analysis, write the complexity of its worst-case time. d) Prove your algorithm is correct-it terminates with the valid output in every case