14. Suppose that the loop body in Example 2(a) is changed to FACT FACT m m = m + 1. . How should the initialization and guard be changed in order to get the same output, FACT = n!? The loop invariant may change. 15. Do the two algorithms shown produce the same output? Explain. Algorithm A begin k := 1 while k < 4 do k := k print k k :=k+1 end Algorithm B begin for k=1 to 4 do k := k print k end