ICllscar has lost his dog in either forest A {with probabilityr pg) or forest B (with probability p5 = 13414). If the dog is alive and not found by nth day of the search, it will die that evening with probability nf(n+2). If the dog is in forest A and Oscar spends the day searching in forest A, he will nd the dog with probability fA. Similarly, if the dog is in forest B and ICllscar searches there, he will nd the dog with probability f3. The dog cannot move from one forest to another, and Oscar can only search one forest per day. Let pi = 0.6, f3 = 0.25 and f5 = 0.15. BONUS: Create a MATLAB simulation that can simulate, given a search policy, the search process until the dog is dead or found alive. Run 1000 simulations and use them to approximate the probability that the dog is found alive if (i) Only forest A is searched (ii) Only forest B is searched (iii) The forest to visit is selected randomly with the same probability each day