Please answer appropriately. Much thanks

1) Assume we are working on a system that has 1KB of memory available for the heap (Yes, it's pretty small but let's work with this as it makes the problem more tractable for an exam). Using the dynamic memory allocation algorithms we used in class, give the address returned for each of the memory requests. For simplicity, memory starts at address 1. If the memory request cannot be satisfied, then return 0 and stop. First Fit Best Fit Worst Fit Request Allocate A 64 Allocate B 128 Allocate C 512 Free B Allocate D 128 Free A Allocate E 128 Free C Allocate F 64 Allocate G 256 Allocate H 256 Free G Allocate I 160 Free D Allocate J 64