Q1

.

and also define ,longest independent path ./

Q2.

and also define predicate nodes./

Answer the following question (91-95) based on flow graph F. A flow graph F with entry node (1) and exit node (11) is shown below: Flowgraph F How many nodes are there in the longest independent path? (1) 6 (2) 7 (4) 9 How many predicate nodes are there and what are their names? (By Three : (1. (2. 3). 6) (2) Three : (1. 4.6) Four : (2, 3). 6. 10. 11) (4) Four : (2.3). 6. 9. 10)