Exercise $1$

A compiler designer is trying to decide between two code sequences for a particular computer. The hardware designers have supplied the following facts:

CPI for each instruction class

$\backslash$table$[[$A$,$B$,$C$],[$CPI $1,2,3]]$

For a particular high$-$level language statement, the compiler writer is considering two code sequences that require the following instruction counts:

Code sequence Instruction counts for each instruction class

$\backslash$table$[[,$A$,$B$,$C$],[1,2,1,2],[2,4,1,1]]$

Which code sequence executes the most instructions? Which will be faster? What is the CPI for each sequence? $($Show your work in details$)$