Answer the following questions about the sequence of instructions:

loop: CBZ X13, exit ADD X9, X13, X10 SUB X13, X13, 1 B loop exit: ADD X0, X12,XZR

A. Assuming all possible forwarding paths, always-not-taken policy for branch (conditional and nonconditional), and branch resolution in ID stage, how many cycles will this sequence take to execute? Assume X13=0x1 at the start of this program. You may want to draw a pipeline diagram.

B. List all forwarding paths used. Each item in your list should contain the cycle number, the stage sending the data, and the stage receiving the data. Note: You may assume forwarding is not required for any instructions preceding or following the provided code segment.