An expression e is said to be very busy at point p if no matter what path is taken from p, the expression e will be evaluated before any of its operands are defined. Give a data-flow algorithm in the style of Section 10.6 to find all very busy expressions. What confluence operator do you use, and does propagation run forward or backward? Apply your algorithm to the flow graph in
Fig. 10.74
