For the flow graph of Fig. 9.10 (see the exercises for Section 9.1): i. Find all the possible regions. You may, however, omit from the list the regions consisting of a single node and no edges. ii....

For the flow graph of Fig. 9.10 (see the exercises for Section 9.1):

i. Find all the possible regions. You may, however, omit from the list the regions consisting of a single node and no edges.

ii. Give the set of nested regions constructed by Algorithm 9.52.


Hi. Give a T\-T2 reduction of the flow graph as described in the box on "Where 'Reducible' Comes From" in Section 9.7.2.

Fig. 9.10