Given the virtual page$-$table for a process betow, answer the questions.

Assume page size is $3K,$ sadress$-$space for the computing device is $2AK$ and there is $12K$ PLAM is available.

$\backslash$table$[[\backslash$table$[[$Virtual page$],[$index$]],\backslash$table$[[$Page$-$frame$],[$index$]],\backslash$table$[[$in RAM $(1)],[$or not $(0)]],\backslash$table$[[$Referenced$],[($R$)]],\backslash$table$[[$Mordified$],[($M$)]],\backslash$table$[[$Page Loading$],[$time$]],\backslash$table$[[$Cast Referenced$],[$Time$]]],[7,x,0,,,,],[6,1,1,1,0,1013,114],[5,x,0,,,,],[4,0,1,1,1,878,140],[3,2,1,0,1,986,654],[2,x,0,,$te$,$dots,en$.],[1,x,0,$wn$,,$II$,,],[0,3,1,1,1,854,427]]$

Q$\mathrm{.}9.$ Consider Not$-$Recently$-$Used page replacement algorithm is in use. In case of a page$-$fault, the PageFrame index for the victim page $($page to be replaced$)$ is:

Victim page Virtual$-$Page index

Q$\mathrm{.}10.$ Consider First$-$In$-$First$-$Out $($FIFO$)$ page replacement algorithm is in use. In case of a page$-$fault, the Page$-$Frame index for the victim page $($page to be replaced$)$ is:

Victim page Virtual$-$Page index

Q$\mathrm{.}11.$ Consider Least$-$Recently$-$Used page replacement algorithm is in use. In case of a page$-$fault, the Page$-$Frame index for the victim page $($page to be replaced$)$ is;

Victim page Virtual$-$Page index :

$2\mathrm{.}12.$ Find whether the following virtual addresses are currently in RAM or not and if in RAM then write their corresponding actual RAM addresses.

NOTE: If not in RAM use $"x"$ for actual RAM address.

$\backslash$table$[[$Virtual Address,$\backslash$table$[[$In RAM$],[[$es $/$ No$]],$Actual RAM Address,$],[$Decimal$,$Binary,,,,$],[10300,0010100000111100,,,,],[16540,0100000010011100,,,,],[3617,0000111000100001,,,,],[19786,0100110101001010,,,,]]$