PLEASE HELP ASAP, MANY STUDENTS ARE IN NEED OF THIS WORK !!!!!!! C PROGRAMMING - WILL UPVOTE

MANY STUDENTS AND I REALLY NEED HELP WITH THIS ANDWILL UPVOTE IF CORRECT !!!!

****Please do not copy from other answers, as they are incorrect and this is a different question****

- in C programming language only, ensure no errors.

- please complete all parts

THANK YOU SO SO MUCH :)

Part 1: Set Up

*******DELIVERABLES TO CODE ******

*********Please continue the code from part one and modify it according to the deliverables below ********

********MEMORY MANAGEMENT INFO ( this is needed background information for part 2 code of the process implimentations)*********

Assignment Scope: Memory Management 1. First Fit Implementation: a. Input memory blocks with size and processes with size. b. Initialize all memory blocks as free. c. Start by picking each process and check if it can be assigned to current block. d. If size-of-process <= size-of-block if yes then assign and check for next process. e. If not then keep checking the further blocks.

2. Best Fit Implementation: a. Input memory blocks with size and processes with size. b. Initialize all memory blocks as free. c. Start by picking each process and find the minimum block size that can be assigned to current process i.e., find min(blockSize[1], blockSize[2],.....blockSize[n]) > processSize[current], if found then assign it to the current process. d. If not, then leave that process and keep checking the further processes.

3. Worst Fit Implementation: a. Input memory blocks with size and processes with size. b. Initialize all memory blocks as free. c. Start by picking each process and find the maximum block size that can be assigned to current process i.e., find max(blockSize[1], blockSize[2],.....blockSize[n]) > processSize[current], if found then assign it to the current process. d. If not, then leave that process and keep checking the further processes.

4. Next Fit Implementation: a. Input memory blocks with size and processes with size. b. Initialize all memory blocks as free. c. Start by picking each process and check if it can be assigned to the current block, if yes, allocate it the required memory and check for next process but from the block where we left not from starting. d. If the current block size is smaller, keep checking the further blocks

*******DELIVERABLES TO CODE ******

**********EXPECTED AND NEEDED OUTPUT********

THANK YOU SO INCREDIBLY MUCH