Software Engineering

Consider the following program P. You may construct a flow graph of P. Each block is assigned an alphabetic number (A to K ) of P. Program P; A. if (((A>B) II (A>C))&&(B>C)) B. if B>C i C. print("B is big"); else D. print ("C is big") ; J else E. if A>C F. if (B+C)>A) G. print ("A is smaller than B+C "); else H. print (" A is bigger than B+C "); else 1. print ("C is greater that A ); 1 J. print ('Completed'); K. print ('End'); Choose a test set T such that by executing program P for each test case in T, the following items are tested: (i) Multiple Condition Coverage of P; (ii) Is there any infeasible path? If yes, which one? (iii) Compute complete morphology of this program