$0/1$ point $($graded$)$

Select all that are true

In an MDP$,$ the optimal policy for a given state $s$ is unique

The problem of determining the value of a state is solved recursively by value iteration algorithm

For a given MDP$,$ the value function $V^{**}(s)$ of each state is known a priori

$V^{**}(s)={\displaystyle \underset{s^{\text{'}}}{\overset{?}{}}}T(s,a,s^{\text{'}})[R(s,a,s^{\text{'}})+V^{**}(s^{\text{'}})]$

$Q^{**}(s,a)={\displaystyle \underset{s^{\text{'}}}{\overset{?}{}}}T(s,a,s^{\text{'}})[R(s,a,s^{\text{'}})+V^{**}(s^{\text{'}})]$