unix please, output should look like the one listed please

Managing Free Memory with Linked List: write a first fit program to manage free memory using linked list as in Figure 3-6(c).

Then test your program using the following memory use pattern by printing out the linked list after each memory use or free event: there are in total 10 memory units, and the memory's use pattern is as follows: A (use 2 units) , B (use 3 units), C (use 4 units), D (free 3 units of B), E (use 1 unit), F (free 4 units of C), G (free 2 units of A) and H (use 5 units).

out look should be similar to this pattern: A: (p,0,2), (H,2,8) B: (p,0,2), (p,2,3), (H,5,5)

and so on for the answer of total 8 unit C: D E: F: G: H:

16 24 P 14 4 11001111 H 18 2 P 20 6 P 26 3 Hole Starts Length Process at 18 2 Figure 3-6. (a) A part of memory with five processes and three holes. The tick marks show the memory allocation units. The shaded regions (0 in the bitmap) are free. (b) The corresponding bitmap. (c) The same information as a list. 16 24 P 14 4 11001111 H 18 2 P 20 6 P 26 3 Hole Starts Length Process at 18 2 Figure 3-6. (a) A part of memory with five processes and three holes. The tick marks show the memory allocation units. The shaded regions (0 in the bitmap) are free. (b) The corresponding bitmap. (c) The same information as a list