Problem Statement Considering the search problem, we have a list of n integers A = (0), 02, ... v,). We want to design an algorithm to check whether an item v exists or not such that it should return...

Considering the search problem, we have a list of ?n integers ?=⟨?1,?2,⋯??⟩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 theindex, ?i, if it was found or −1−1 otherwise, whennot found.

Extracted text: Problem Statement Considering the search problem, we have a list of n integers A = (0), 02, ... v,). 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) Algorithm Implementation b) Growth Curve Empirically, using time measurements, test your algorithm and plot a graph that shows its growth rate when variating the size. c) Theoretical Analysis Derive the complexity of the worst-case time, and show your reasoning