2. Exercise E3.10 of the textbook.

A spreadsheet keeps track of student scores on all the exams in a course. Each row of the spreadsheet corresponds to one student, and each column in a row corresponds to his/her score on one of the exams. There are r students and c exams, so the spreadsheet has r rows and c columns.

Consider an algorithm that computes the total score on all exams for each student, and the average class score on each exam. You need to analyze the running time of this algorithm.

A. What are the basic operations you would count toward the running time?

B. What is the worst-case running time as a total count (not big O) of these basic operations?

C. What is the big O running time?

D. Is your algorithm linear, quadratic, or some other order?