2. Consider the FMOC (Finite Multi-Order Context Model) algorithm of Kroeger and Long. In this example m = 3 (the highest order allowed) was used. Suppose that several files have been accessed. It is currently time T. The most recent three accesses were A then B then A. The tree data structure from the FMOC algorithm at time T is currently root A(3) B(4) C(1) B(3) A(2) 1 C(1) B(2) C(1) B(1) 1 I B(1) 4(1) A(1) a) Give the the zeroth-order prediction from the FMOC algorithm at time T. FMOC's zeroth-order prediction for the next file access: (If you are writing your answers on a separate sheet of paper rather than printing the test, then write the above statement and draw a blank and then fill in the blank.) b) Give the the second-order prediction from the FMOC algorithm at time T FMOC's second-order prediction for the next file access: 2. Consider the FMOC (Finite Multi-Order Context Model) algorithm of Kroeger and Long. In this example m = 3 (the highest order allowed) was used. Suppose that several files have been accessed. It is currently time T. The most recent three accesses were A then B then A. The tree data structure from the FMOC algorithm at time T is currently root A(3) B(4) C(1) B(3) A(2) 1 C(1) B(2) C(1) B(1) 1 I B(1) 4(1) A(1) a) Give the the zeroth-order prediction from the FMOC algorithm at time T. FMOC's zeroth-order prediction for the next file access: (If you are writing your answers on a separate sheet of paper rather than printing the test, then write the above statement and draw a blank and then fill in the blank.) b) Give the the second-order prediction from the FMOC algorithm at time T FMOC's second-order prediction for the next file access