Assuming Tomasulo's Algorithm is implemented in the following CPU without reorder buffer.Initially, R$1=1000,$ and Fx $=$ x $($e$.$g$.,$ F$0=0,$ F$2=2,$ etc$).$ Show the contents in both reservation stationsafter enough long time but the load instruction is still waiting for the results from memory. Use the name SB$,$ LB$,$ RSADD, RSMUL to represent store buffer, load buffer, reservation station for adder, and reservation station for multiplier, respectively.