Suppose that A, B, C are unique files. Suppose that at time t1, file B was opened. At time t2, file A was opened. At time t3, file B was opened. At time t4, file C was opened. It is currently time t5, and file B is open. (t1 < t2 < < t5.) Thus, files have been accessed in the order B, A, B, C, B with the last of those files being currently open at time t5.

Draw the tree data structure kept by the FMOC (Finite MultiOrder Context Model) algorithm of Kroeger and Long at each time right after each file is accessed. So, draw the FMOC tree data structure immediately after the file access at time t1, draw the tree data structure immediately after the file access at time t2, ..., and draw the tree data structure immediately after the file access at time t5. Assume that m = 3 (the highest order allowed). In each tree data structure, circle the nodes that changed from the previous step. (Do not circle the nodes that didnt change.)