Find largest algorithm get a value for n, the size of the list get values for a1, a2, an, the list to be searched set the value of largest_so_far to a1 set the value of location to 1 set the value to i to 2 while ( i < = n ) do if a1 > largest_so_far then set largest_so_far to a1 set location to i add 1 to the value of i end of the loop print out the values of the largest_so_far and location stop question: if the numbers in our list were not unique and therefore the largest number could occur more than once, would the algorithm find the first occurrence? (select: true for "yes"; false for "no")