Problem 5 (Multiple-Issue Processors, Chapter 4) This exercise compares the performance of 1-issue and 2-issue processors, taking into account the program transformations that can be made to optimize for 2-issue execution. Assume we have the following C program. for (i-0 i!-j i+-2) When translating into MIPS code, assume that variables are kept in registers as shown in following table, and that all registers except those indicated as Free are used to keep various variables so they cannot be used for anything else Free r5 r6 rlr2 r3 r10, rll, r12