Do the following exercises. 1. Assume that the memory unit on the GPP presented in lecture has the contents shown below. Further assume that the tiny program is loaded at location 0, that the PC starts out with 0 as its contents, and that all memory locations Mi] contain i+1. Trace the execution of the program, with a table showing the contents of all machine registers after each clock cycle. 11 000010 10 000000 00 000100 10 000000 Do the following exercises. 1. Assume that the memory unit on the GPP presented in lecture has the contents shown below. Further assume that the tiny program is loaded at location 0, that the PC starts out with 0 as its contents, and that all memory locations Mi] contain i+1. Trace the execution of the program, with a table showing the contents of all machine registers after each clock cycle. 11 000010 10 000000 00 000100 10 000000