please show all step and please solve them all.

Real time system course .....

q1/ Find the maximum possible response time of task T4 in the following fixed-priority system by

solving the equation w4(t) = t iteratively. T1 = (5,1), T2 = (3,1), T3 = (8,1.6), and T4 = (18,3.5)

q2/

A system contains the following periodic tasks: T1 = (5, 1), T2 = (7, 1, 9), T3 = (10, 3), and

T4 =(35,7).

(a) If the frame size constraint (5-1) is ignored, what are the possible frame sizes?

(b) Use the largest frame size you have found in part (a), draw the network-flow graph of the

system.

(c) Find a cyclic schedule by solving the network-flow problem in part (b) or show that the

system cannot be feasibly scheduled according to a cyclic schedule of the frame size used in part (b).