Suppose there are 8 virtual pages and 4 frames. There are a number of memory accesses according to the following sequence 0142326510234713. Assume that the frames are initially empty. Please complete the following tasks. (1) Write down the page replacement sequences by using each of the following page replacement algorithms: (a) FIFO (b) LRU (c) Optimal. (2) Give the number of page faults that will occur in each above algorithm.