Request Sequence: Allocate(D), Allocate(B), Allocate(F), Deallocate(D), Deallocate(F), Allocate(G), Allocate(I) First-fit The best algorithm for this sequence of requests is: The amount of internal fragmentation (in KB) for this algorithm is Best-fit First-fit b) Request Sequence: Allocate(C), Allocate(E), Allocate(D), Allocate(A), Deallocate(C), Deallocate(D), Allocate(H), Allocate(F), Allocate(J) Best-fit The best algorithm for this sequence of requests is: The amount of internal fragmentation (in KB) for this algorithm is First-fit Worst-fit c) Request Sequence: Allocate(I), Allocate(H), Allocate(G), Allocate(F), Allocate(D), Deallocate(I), Deallocate(G), Deallocate(D), Allocate(K), Allocate (E), Allocate(G), Allocate(A) Best-fit Worst-fit The best algorithm for this sequence of requests is: The amount of internal fragmentation (in KB) for this algorithm is Worst-fit

//Algorithm should: /*NOT destroy any of the originally even-valued node.     This means that the originally even-valued nodes should be retained as part of the resulting list.    Destroy ONLY nodes that are originally odd-valued.    Create new nodes and copy data between nodes ONLY when duplicating originally even-valued nodes.    Only ONE new node should be created for each originally even-valued node.    Creating pointer-to-node's (to provide temporary storage for node addresses) does not constitute creating new nodes or copying of items.    NOT make any temporary copies of any of the data items (using any kind of data structures including but not limited to arrays, linked lists and trees).    This means that the algorithm should largely involve the manipulation of pointers.    Function must be iterative (NOT recursive) - use only looping construct(s), without the function calling itself (directly or indirectly).    Function should not call any other functions to help in performing…