The tricky part here is calculating the size of the page table. Once you have that, multiply it times the time it takes to load each table entry. It's not relevant how big a table entry is - only how long it takes to load it.
So think about a 32 bit address space. How many 8K chunks are there in it? That's the part of the document you referenced that is subracting bits. It takes 13 bits to describe 8K. Notice that 2 ^ 13 = 8K (Quickly calculate it by noting that 1024 takes 10 bits. It's sort of mnemonic and easy to remember. 8 takes 3 bits and 10 + 3 = 13. Or use a calculator to see what power of 2 equals 8K.)
32 bits for the whole address space less 13 gives 19, so there are 2 ^ 19 pages.
Now just multiply 2 ^ 19 times 100 ns and bingo. You have it.