Any help on the below would great be looked up upon.

i) Assume that you have a demand paged memory. It takes 7.5 milliseconds to service a page fault. The TLB hit rate is 20 percent. The TLB access time is 18 nanoseconds. Memory access time is 100 nanoseconds. The page fault rate is .001. What is the EAT?

ii) Given five memory partitions of 100 KB, 300 KB, 200 KB, 500 KB, and 400 KB (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 200KB, 417 KB, 100 KB, 350 KB and 100 KB (arriving in order)?