Problem 2.8. The data flow diagram in Fig. 2.29 demonstrates reconvergent edges: edges which go around one actor. Reconvergent edges tend to make analysis of a data flow graph a bit harder because they may imply that multiple critical loops may be laying on top of one another. This problem explores this effect. 1 5 8 7 Fig. 2.29 SDF graph for Problem 2.8 Determine the loop bounds of all loops in the graph of Fig. 2.29. Take the input/output constraints into account by assuming an implicit loop from output to input. A. B. Using the results of the previous part, determine the iteration bound for this graph C. Find the effective throughput of this graph, based on the distribution of delays as shown in Fig. 2.29. Does the system as shown in Fig. 2.29 achieve the iteration bound? If not, apply the retiming transformation and improve the effective throughput so that you get as close as possible to the iteration bound. D