6. Consider the algorithm shown below. In the space provide, give the number of times each line of the algorithm will be executed. Then, give Tin) and the big-o classification for the algorithm. procedure find( key, a1, A2, ..., an) loc:= 0 i:=1 while (i