Problem $4[30$ Pts$].$ Dataflow Graphs. $($Note: DFGs will be introduced in Lecture on HLS$)$

Consider the following dataflow graph, assume multiplication takes $3$ cycles and addition takes $1$ cycle.

A$)$ What is the minimum latency of this graph $($time until all operations complete$)$ if there is only a single adder and multiplier? Show your work. $(15$ Points$)$

B$)$ What is the minimum latency of this graph $($time until all operations complete$)$ if there are infinitely many adders and multipliers? Show your work. $(15$ Points$)$