1. a) 5 Assume that to spell check a large file, 820,000,000 instructions are needed. The instructions in the program are broken down into 4 different classes, and each class requires N clock cycles to execute. Specific information is given in the table below. (Here, N is the same as in the MIPS multi-cycle datapath discussed in class.) Instruction Class Branch Store Load ALU / R-type Clock Cycles per Instruction 3 4 5 4 Number of Instructions 150,000,000 185,000,000 260,000,000 225,000,000 If the total execution time for this program is found to be 1.57 seconds, what is the clock cycle time of the computer on which it was run