Baking a cake is like parallel computing three loop iterations. Explain why the cake-making loop has data-level and task-level parallelism.

Loop fusion, loop fission, loop peeling, and loop exchange—what do these terms mean?

What is loop unrolling and how can it improve pipelined execution?

Please DO NOT respond to this question by copy/pasting the code provided elsewhere on the site, none of those work. Thanks. Virtual Memory Lab   This lab project addresses the implementation of page-replacement algorithms in a demand-paging system.   Each process in a demand-paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained.   The page table data structure is a simple array of page-table entries (PTEs). Each PTE contains five fields as defined below:    struct PTE {        int is_valid;        int frame_number;        int arrival_timestamp;        int…