If we need to manage a contiguous range of memory, handling requests to allocate various sized chunks, and later make those chunks free for reuse (as the malloc() and free() routines do in a C program), we have a number of linked list allocation algorithms that we could choose from. If our primary objective in allocating a chunk was to leave the smallest fragment possible after the allocation, which algorithm would we implement?a. slab allocator. b. worst-fit allocator. c. first-fit allocator. d. best-fit allocator. e. bit-map allocator.

Write a defining table and then a program that determines if you can sleep in or not. your program should get all its input from your computer’s clock. on all weekdays (monday through friday) that are not holidays, your program should output “get up! ” on all other days (weekends and holidays), your program should output “sleep in.” the three holidays that your program must check for are january 1 (new year’s day), july 4 (u.s. independence day), and december 25 (christmas). you don’t need to include other holidays in your program because most other holidays do not occur on a fixed day each year.