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 T(n) and the big-o classification for the algorithm. procedure find( key, a., 22, ..., a.) loc := 0 i:=1 while (i