Evaluate Least Recently Used (LRU) page replacement algorithm using 3 frames by running it on a particular string of memory references (reference string) and computing the number of page faults. 1,2,3,4,1,2,5,1,2,3,4,5 Evaluate optimal page replacement algorithm using 4 frames by running it on a particular string of memory references (reference string) and computing the number of page faults. 0,1,3,6,2,4,5,2,5,0,3,1,2,5,4,1,0 Evaluate NFU page replacement algorithm using 3 frames by running it on a particular string of memory references (reference string) and computing the number of page faults. 0,1,3,6,2,4,5,2,5,0,3,1,2,5,4,1,0 Consider 2-Mbyte of memory is allocated using Buddy System. Show the Binary tree form for the following: Request 60k(A) Request 240k(B) Request 150k(C) Request 256k(D) Release B Release A Request 75k(E) Release C Release E Release D