b$.$ Exercise $6\mathrm{.}1($b$)$ vs$.6\mathrm{.}1($c$)$Estimate the speedup between the following data paths when generating N$=1000$ quantities A$\_$i$+$B$\_$i$+$C$\_$i$+-$D$\_$i for i$=0,1,2,...,999.$ Ignore the data reading and writing delays.

Hint:

Before computing the speed up$,$ compute the Tpipe$-$line for $1000$ entries. You may use the clock period for one operation from your earlier work in $6\mathrm{.}1.$c$.$ Similarly, you need to compute the time required for $1000$ operations of Single$-$cycle and multi$-$cycle data paths.