2. [X points) Below is an algorithm for Linear Search. a. Considering the worst case, fill in the Times column for each Line (1 point per line). Cost column is already filled for you, no additional writing is necessary in that column) Times def linear Search(mylist, target): Line 1 found = False Line 2 for i in range(len(mylist)): Line 3 if mylist[i] == searchltem: Line 4 found = True Line 5 print(searchitem,' was found at index:,i) Line 6 break Line 7 if found == False: Line 8 print(searchltem,' was not found in the list.") b. Complete T(n) for the worst case only. [X points each blank] T(n)=C:_+02: ___+cz:___+4'-_+cs: __+ '__+c,: ___+Cg