he SCAN-EDF strategy is a combination of the SCAN and EDF mechanisms. The seek optimization of SCAN and the real time guarantees of EDF are combned in the follwoing way; like in EDF, the request with the earliest deadline is always served first, among requests with the same deadline, the specific one that is first according to the scan direction is served first,, among the remaining requests, this principle is repeated until no request with tis deadline is left.

ANS

Since the current time is 15 msec, we start with the request that has the closest deadline within the current set of four requests. In this case, the closest deadline is 32 msec, which corresponds to request P1.

We service P1, which takes 6 msec, and move to the next request in the set, which is P4. We service P4, which also takes 6 msec, and move to the next request in the set, which is P2. We service P2, which takes another 6 msec, and move to the final request in the set, which is P3. We service P3, which takes 6 msec.

The total time to service all four requests is 6 + 6 + 6 + 6 = 24 msec.

Since the total time to service all four requests is less than the earliest deadline in the set (32 msec), there is no missed deadline.

WHY I AM GETTING DIFFERENT ANSWER PLEASE DRAW IN TABULAR FORM