36 bit virtual address space. But each process uses on average 8GB only.
Consider 1 level paging:
Size of page table = no. of PTE entries * PTE size
= Address Space * PTE size/Page size
$=\frac{2^{36} \times 4B}{8\times 2^{10}} = 2^{25} B= 32 MB$.
So, size of pagetable is 32 MB for a process using on average 8GB. This is $\frac{1}{256}$ of the total memory usage.
Consider 2 level paging:
We can do this is many ways, but we try to divide the index bits equally among all levels and also give extra bit if any to higher levels to give more chance of lower level pagetable size to be same as a page size. So, out of 36 bits, we have 13 offset bits. Remaining 23 bits can be divided to 12 bits for first level and 11 for second. Now, size of first level page table
$=2^{12} \times 4B= 16 KB$
We have 11 bits for indexing to second level page table. So, size of each second level page table $=2^{11} \times 4B = 8 KB$ - this is exactly the page size
Now, we need to see how many second level page tables will be in memory (first level page table is always in memory). To address 8GB, we need $2^{20}$ pages. And each second level page table addresses $2^{11}$ pages and thus we require $\frac{2^{20}}{2^{11}} = 512$ second level page tables. So, total memory requirement
$= 16KB + 8KB \times 512 = 16KB + 4 MB \approx 4MB$
Consider 3 level paging:
Now we have 23 bits to be divided among the 3 levels and this can be done as 8 -- 8 -- 7. So, size of first level page table $= 2^8 \times 4B = 1KB$.
Similarly size of second level page table = 1KB.
Size of third level page table $= 2^7 \times 4B = 512 B$
To address $2^{20}$ pages, sum of the no. of entries in third level page tables $=2^{20}$.
Since each third level page table addresses 128 pages, we need no. of third level page tables $= \frac{2^{20}}{2^7} = 8K$
Now, we need a second level PTE for each of them which means a total of $8K$ entries. Each second level page table has 256 entries, meaning a total of $\frac{2^{13}}{2^8} = 32$ second level page tables.
So, total memory taken by page tables $= 1KB + 32 \times 1KB + 8K \times 0.5 KB \approx 4MB$
So, 2 level page table is taking same space as 3 level page table and we really do not need a 3 level implementation.
PS: Suppose the average memory usage per process is $64GB$, then what would be the answer?