For the example of multiprocessor memory interference with two processors and two memory modules, explicitly solve the following optimization problem: max: E[B] s.t.: 9 +9 = 1, 91, 92 0. Modify the multiprocessor memory interference example so that processor 1 has associated probabilities r and r, respectively, for accessing module 1 and 2, and processo; 2 has distinct probabilities q and q2 associated with it. Construct the Markov chain state diagram, solve for the steady-state probabilities, and compute E[B]. For those with extra energy, solve an optimization problem analogous