can anyone explain how these answers are found with steps? I need help. thank you!

For the following problem, we add a new state in which we can take the EXIT action with a reward of +x. a) For what values of x is it guarnteed that our optimal policy has (C)=+ ? Write and if there is no upper or lower bound, respectively. Write the upper and lower bounds in cach respective box. If there is no values that we can consider for x to guarantee the condition mentioned above, explain it. For. any values, explain your answer. x b) For what values of x does value iteration take the minimum number of iterations k to converge to V for all states? Write co and if there is no upper or lower bound, respoctively. Write the upper and lower bounds in each respective box, If there is no values that we can consider for x to guanantee the condition mentioned above, explain that. For any values, explain your answer. b) For what values of x does value iteration take the minimum number of iterations k to converge to V "for all states? Write and if there is no upper or lower bound, respectively. Write the upper and lower bounds in each respective box. If there is no values that we can consider for x to guarantee the condition mentioned above, explain that. For any values, explain your answer. c) What is the minimum number of iterations k until Vk has converged to V ' for all states? Explain your