1. Multi-level page tables. Assume a virtual address machine with a 32bit address. Assume the address is divided into 4 parts a,b,c,d with the first three parts used to index into a three level page table and the fourth is used to index into the location on the page. Assume the values for a,b,c,d are 4,6,6,16 respectively resulting in a 64 KB sized page a- what is the total size in bytes of the page tables for the smallest program, which is a program containing a single page of text and heap, starting at location 0, and a separate page for the stack, starting at location OxFFFFFFFF and running downwards. Assume all page table entries are 4 byes each. b- what is the total size in bytes of the page tables for the largest program, which is a program containing text, heap and stack which fill the entire 32bit address space. C- which page table entries are used to access address Oxffff0000