Consider the following pseudo-code and analyze the best and the worst-case running time of this by providing the form of the function the running time takes in each of the cases (Analyze statement-by-statement and use the length of the array as ):

Please analyze the code line by line, stating the cost and number of times each line runs. Similar to page 26 of Cormen's Intro to Algorithms (3rd edition). If you just copy and paste something from ChatGPT your answer will get thumbs down.

2. (10 Points) Consider the following pseudo-code and analyze the best and the worst-case running time of this by providing the form of the function the running time takes in each of the cases (Analyze statement-by-statement and use the length of the array A as n ): \begin{tabular}{l} \hline Algorithm 2 Linear-Search (A,v) \\ \hline 1:i=NIL \\ 2: for j=1 to A.length do \\ 3: if A[j]=v then \\ 4:i=j \\ 5: return i \\ 6: end if \\ 7: end for \\ 8: return i \end{tabular}