Consider hierarchical scheduling is implemented for an EPON system with 2 queues (viz., 1 and 2) located at ONU A and 3 queues (viz., 3, 4 and 5) located at ONU B. The queus have relative priorities of 2, 3, 2, 3 and 5, respectively.The reported buffer occupancy of the queues are 400, 800, 500, 500 and 300 Bytes, respectively. Assume maximum 1200 Bytes can be up-streamed in a cycle time and data transmission overhead (for Request message and the preamble) is 0 Byte per ONU. (i) Find the bandwidth to be allocated to different queues for the given cycle considering Sibling-fair scheduling. (ii) Verify whether fairness is satisfied for all queues. 4) Find solution for the same problem shown above considering the hierarchical scheduling to be cousin-fair scheduling. 5) Consider hierarchical scheduling is implemented for an EPON system with 2 queues (viz., 1 and 2) located at ONU A and 3 queues (viz., 3, 4 and 5) located at ONU B. The queues have relative priorities of 2, 3, 2, 3 and 5, respectively.The reported buffer occupancy of the queues are 400, 800, 500, 500 and 300 Bytes, respectively. Assume maximum 1200 Bytes can be up-streamed in a cycle time and data transmission overhead (for Request message and the preamble) is 72 Bytes per ONU. (i) Find the bandwidth to be allocated to different queuesfor the given cycle considering Sibling-fair scheduling. (ii) Verify whether fairness is satisfied for all queues. 6) Find solution for the same problem shown above considering the hierarchical scheduling to be cousin-fair scheduling.