a$)$ In a memory management with swapping, what are the advantages$/$disadvantages of using the following algorithm

to allocate memory for a newly created process?

i$)(4$ pts$)$ best fit algorithm

ii$)(4$ pts$)$ worst fit algorithm

b$)(6$ pts $)$ In a virtual memory management with $4$ page frames, the nodes of the following linked list hold

information as follows: page number page frame number load time R$-$bit

Where the page frame number indicates the page frame where a page has been moved into memory, and load time

is the time at which it has been moved

Show the status of the linked list after page number $6$ has been moved into memory using second chance page

replacement algorithm at load time $15.$