Assume a single standard three stage (load, execute, write back) functional unit. Also assume that the execution (stage 2) of multiplication requires 3 units of time, subtraction requires 2 units of time, and addition requires 1 unit of time. Stages 1 and 3 require 1 unit of time. If the computer can perform instruction level parallelism, then how many units of time are there when an instruction is stalled in stage 1? A stall is when an instruction has ENTERED and COMPLETED stage 1, but is not able to leave stage 1 because stage 2 is occupied. Do NOT count the 1 unit of time that an instruction spends in stage 1 while the operands are loaded.
type function2(type a, type b, type c, type d){
type var1 = a - b;
type var2 = var1 * c;
type var3 = a + d;
return var3;
}