FINITE-STATE SYSTEMS - Real Time System Scheduling

I need help with the following questions i) Consider the CES model checker for CTL. If we are going to model the exe- cution of a program with n Boolean variables and m integer variables, each of which ranges from 0 to 10 (inclusive), what is the maximal number of states in the state graph. ii) Consider a simple algorithm for solving the mutual exclusion problem for two processes. Construct the state transition diagram for this algorithm. Prove or disprove the following properties by first expressing them in CTL formulas and then by following as much as possible the labeling technique in the CES model checker. (a) Only one of the two processes can be in the critical section at any one time. (b) The two processes will not deadlock.