Arrange the following branch/jump instructions in the descending orderof their maximum possible jump target.

Arrange the following branch/jump instructions in the descending orderof their maximum possible jump target. That is, the instruction that allows the farthest possiblejump must go first, followed by the next farthest, and so on. If two instructions allow the sameamount of jump, list them in any order. Also state encoding format (R/I/J) and the number ofbits used to represent the target address for each instruction. Finally, list for each instruction themaximum distance that can be jumped, both forwards and backwards in memory.

j, beq, jr, jal, bne