These are a Markov Decision Process and reinforcement learning problems. These is also advanced statistics.

Please write your explanation of how you came up with the answer for a thumbs up! Thank you!

1. How many deterministic policies are there for an MDP with |S| < and A < ? (You may write your answer in terms of |S| and |A|)

2. Can an MDP be aperiodic and not irreducible? If so, give an example. If not, explain your reasoning.