Consider a memory of size 16KB. This memory is allocated in increments of 1KB and the memory is initially empty. Use the various contiguous allocation schemes (First-fit, Best-fit, and Worst-fit) for satisfying the memory allocation/deallocation requests for processes requesting the sizes shown in the table below.

Allocate (P) represents an allocation request by process P for the size shown in the above table Deallocate (P) is used to indicate deallocating the memory allocated to process P To represent memory, in square brackets, we use P to indicate a memory segment allocated to P and we use an integer to indicate a contiguous free part of memory. For example, after the following sequence of requests: Allocate(B), Allocate(G), Allocate(H), Deallocate(G) memory will look like this: We represent this memory by [B,2,H,4]. For each of the following sequence of requests, apply the First-fit, Best-fit, and Worst-fit allocation schemes. Assume that for each algorithm, you always start at the beginning of the list and if there are multiple possible equal-size holes that can be selected by an algorithm, the first one is selected. Show the following: i. If all the requests can be satisfied, indicate the memory representation at the end of the sequence. If a request cannot be satisfied by an algorithm, indicate which request is this and the memory representation at this point. For example, consider adding the request Allocate (X) to the previous example. The following are answer examples If X is requesting 6KB the answer will be: [B,2,H,4] and Allocate (X) cannot be satisfied If X is requesting 3KB, the answer will be [B,2,H,X,1] ii. Which method is the best for this particular sequence, and the amount (in KB) of internal fragmentation at the end of the sequence for this best method. c)