You have been assigned the task of designing an algorithm for the following task. Someone has built an array of the person numbers of all the n students enrolled in 331 this fall. In particular, you have no information about the order in which the person numbers are stored. The only operation that you are allowed is to be able to query the person number at the ith location of the array (for any 1  i  n). Present a (n) time algorithm that given any input person number p, will report whether or not p is enrolled in the class. Prove both the O(n) and (n) bounds on the running time of your algorithm. (You can assume that every access to the database takes 1 step.)