I'm trying to tackle this question to understand MDP. Can someone explain how can you determine or calculate the number of distinct deterministic policies in the below MDP? Or resources where I can learn how to do this. I watched various videos and tried to google a way to calculate this but I seem to be going in circles. I have checked other examples as well but I don't see how it can be calculated.
The question is as follows,
Actions are represented by black dots. The pair of numbers beside each arrow indicates the transition probabilities (the left number) under action and the rewards (the right number) received when the agent goes to a state. Assume a discount factor of γ = 0.95.
