Consider the Data Flow Graph $($DFG$)$ below.

Assuming that the multiplication takes $2-$time units, and the addition takes $1$ time unit, your task is to:

$-$ identify the loops

$-$ The iteration period bound $($IPB$)$

$-$ calculate the critical path

$-$ draw a retimed diagram to reduce the critical path delay.