Given the following code:

A $=$ B$+$C

L $=$ A$+$C

D $=$ A$+$E

F $=$ D$+$E

M $=$ A$+$D

G $=$ A$+$D

N $=$ F$+$M

a $)$ List all dependencies using the first letter of an instruction to identify the instruction

For example: RAW A$-$B $($if B was calculated before A could read it; only list the dependencies between the instructions shown, B instruction is just an example and is not shown in the code$)$

b$)$ Compute the total execution time if the code is executed on its original sequence in a $6-$stage processor $($fetch$,$ decode, fetch operands, execution$1,$ execution$2,$ writeback$),$ working at $250$ MHz$.$