Problem 2(5 points): Fill in the Table to describe the remaining five infeasible paths for the given progranm 1 Read(X); C1 C2 C3 C4 C C6 7 Result 2 1 T No 3 IF (X-N 2 60) then N N60; 4 IF (X-N 30) then N- N + 30; S IF (X-N 2 15) then NN + 15; 6 IF (X-N 8) then N-N + 8; 7 IF (X-N 2 4) then NN+4 8 IF (X-N2 2) then N N2; 9 IF (X-N2 1) then N N+1; 10 Result N 60 30 15 8 0001111 F No Problem 2(5 points): Fill in the Table to describe the remaining five infeasible paths for the given progranm 1 Read(X); C1 C2 C3 C4 C C6 7 Result 2 1 T No 3 IF (X-N 2 60) then N N60; 4 IF (X-N 30) then N- N + 30; S IF (X-N 2 15) then NN + 15; 6 IF (X-N 8) then N-N + 8; 7 IF (X-N 2 4) then NN+4 8 IF (X-N2 2) then N N2; 9 IF (X-N2 1) then N N+1; 10 Result N 60 30 15 8 0001111 F No