Given this program code:

a) Construct a flow graph of P: b) Find all the paths in the program: c) Are there any infeasible path? if yes then state them. d) Calculate morphology: e) Calculate cyclomatic complexity: Please solve it like this way, thats another example. Solve it with your hand writing, please I WILL UPVOTE

Program P; A. get(height, width,length) B. if(height>length) \{ C. if(width>length) \{ D. [function call]; E. go to(14); else \{ F. print("__"); G. \}else if(height==length) \{ H. if(height!=length) \{ I. I. print(" \}else \{ J: goto (14);} K. \}else if(height B)(A>C))&&(B>C)) B. if B>C{ C. print("B is big"); else D. print(" nC is bigg ; 7 t else E. if A>C \{ F. if ((B+C)>A) \{ G. print("A is smaller than B+C ") : t else \{ H. print(" A is bigger than B+C ); f f else I. print (nC is greater that AN); f + J. print ('Completed'); K. print ('End') : Answer: (a) Flow graph of P