The main goal of Lab 12 (to be held on December 1 and 2, 1997) is to study empirically the time complexity of serial and binary search. Students will implement a program that counts the number of arracy accesses for serial and binary search. They will calculate the number of accesses for arrays of size 50, 100, 150, 200, and plot their results. The plots will be taken to class on Tuesday and Thursday and used to verify the correctness of the analysis of the average case complexity for serial search (carried out on the previous Thursday) and to support the analysis of worst-case complexity of binary search (to be done on Tuesday and Thursday).