can you answer it pleasssse i have 30 minutes for the deadline

Assume that you are using linear search algorithm to find the position of element x=11 In the list L-(1,2,3,4,5,6,7,8,9,10). What is the number of comparisons done by the algorithm until it finds the position of x? (Include all comparisons in your count!) Lincar search algorithm is given as: procedure linear search(x:integer, 01, 02,...,: distinct integers) 1:-1 while lisnand xa) if is n then location=1 else location :- 0 return location Select one: O a 12 O b. 20 O c22 d. 11