Write the Code with Java. Write with java

Dynamic storage allocation problem concerns how to satisfy a request of size n from a list of free holes. There are many solutions to this problem. The first-fit, best-fit, and worst fit strategies are the ones most commonly used to select a free hole from the set of available holes. First fit allocates the first hole that is big enough. Best fit allocates the smallest hole that is big enough. Worst fit allocates the largest hole. Implement first-fit, best-fit, and worst-fit algorithm. Given an input queue and list of available blocks, your program will allocate appropriate blocks based on the particular algorithm