The operating system maintains a linked list where each node represents each partition. Every node has three fields: A field that stores a flag bit which shows whether the partition is a hole or a process. A field that stores the starting location of the partition. A field that stores the size of the partition. 1. Draw the linked list that represent the memory allocation shown here. 2. Redraw the linked list after process 2 terminates. 3. Redraw the linked list when process 4 is loaded. Assume process 4 requires 300 memory address and allocation uses first fit algorithm