The below instructions are being run in a pipelined datapath. How many clock cycles are required for the above code sequence in case of an ideal pipeline? $($no hazard$)$ Add X$21,$ X$22,$ X$23$ Sub X$21,$ X$23,$ X$24$ Mul X$22,$ X$23,$ X$26$ LD X$22,0($X$21)$ Question $-14$: Add X$21,$ X$22,$ X$23$ Sub X$23,$ X$22,$ X$24$ Mul X$22,$ X$22,$ X$26$ LD X$22,0($X$21)$ a$.$ The below instructions are being run in a pipelined datapath. How many clock cycles are required for the above code sequence in case of an ideal pipeline? $($no hazard$)$ b$.$ How many data hazards are there in the given code sequence? c$.$ Apply only stall $+$ forwarding to overcome the data hazards.