For a set A, the power set of A is denoted by 2^A. If A = {5, {6}, {7}}, which of the following options are TRUE?

I. $$\phi \in {2^A}$$
II. $$\phi \subseteq {2^A}$$
III. $$\left\{ {5,\left\{ 6 \right\}} \right\} \in {2^A}$$
IV. $$\left\{ {5,\left\{ 6 \right\}} \right\} \subseteq {2^A}$$

In the LU decomposition of the matrix $$\left[ {\matrix{ 2 & 2 \cr 4 & 9 \cr } } \right]$$, if the diagonal elements of U are both 1, then the lower diagonal entry $${l_{22}}$$ of L is ________.

Consider a uniprocessor system executing three tasks T₁, T₂ and T₃, each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 milliseconds, respectively. The priority of each task is the inverse of its period, and the available tasks are scheduled in order of priority, with the highest priority task scheduled first. Each instance of T₁, T₂ and T₃ requires an execution time of 1, 2 and 4 milliseconds, respectively. Given that all tasks initially arrive at the beginning of the 1^st millisecond and task preemptions are allowed, the first instance of T₃ completes its execution at the end of _____________ milliseconds.

Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given:

45, 20, 90, 10, 50, 60, 80, 25, 70.

Assume that the initial position of the R/W head is on track 50. The additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards 100 when it starts execution) is____________ tracks.