1. Show that when you apply node splitting to a nonreducible ow graph, and then perform T1-T2 reduction on the resulting split graph, you wind up with strictly fewer nodes than you started with.
2. What happens if you apply node-splitting and T1-T2 reduction alternately, to reduce a complete directed graph of n nodes