D Question Complete the following algorithm (dotted line) so that it locates the last occurrence of the smallest element in a finite list of integers, where the integers in the list are not necessarily distinct Procedure LastSmallest (a1, a2,.., an: integers) min: -a1 location := 1 for i := 2 to n if min 2 ai then min := ai return location O location: O location:-i+1 O location: i-1 location :-1 I Question 8 Give a big-O estimate for the number of operations used in th's segment of an a