1. Given a Buddy system with 7 different holes from 2 to 26, and some processes are already in memory as shown: INITIALLY 2 3 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 a la 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 5354 55 56 57 58 59 60 61 62 63 A. A sequence of releases and requests is made as follows: Process h requests 6 blocks Process i requests 4 blocks Process f releases the first 2 blocks only] Process g releases 3 blocks Process n requests 8 blocks Process j requests 4 blocks Process k requests 2 blocks Process m requests 4 blocks Process c requests 1 additional block Show the final memory layout (by filling in the process letter) after accommodating the requests and releases. Please note that the header pointers always start at the lowest address If there are multiple pointers to the same size holes they are chained lowest to highest. 0 1 4 5 6 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 5354 55 56 57 58 59 60 61 62 63