Show that a flow graph is reducible if and only it can be transformed to a single node using:  a) The operations Ti and T2 described in the box in Section 9.7.2.  b) The region definition introduced...

Show that a flow graph is reducible if and only it can be transformed to a single node using:

a) The operations Ti and T2 described in the box in Section 9.7.2.

b) The region definition introduced in Section 9.7.2.

Show that when you apply node splitting to a nonreducible flow graph, and then perform T\-T2 reduction on the resulting split graph, you wind up with strictly fewer nodes than you started with.