. Write a program, the program can show the simple case, when there are two process using local replacement strategy and global pages replacement strategy, the reader will be used to generate a page access list of routine based on statistical model, this model have N state, from 0 to N - 1, on behalf of every possible page access, the probability of each state I related PI likely represent the next visit is still pointing to the same page, otherwise, the next page access to equal probability to any other page,

A) shows that when N is small, page access string generated routines can run normally, b) to have a process and a fixed number of page frame rate calculation of a page fault, explain why the result is correct, c) to have an independent page access sequence of two processes, and b) in the frame number double page frame, repeat b), d) repeat c) with a global strategy to replace local strategy, similarly, using local strategy method, comparative rate of each process of a page fault,