Question 2 10 points Bandit Example. Consider a multi-arm bandit problem with k-5 actions, denoted 1, 2, 3, 4, and 5. Consider applying to this problem a bandit algorithm using -greedy action selection, sample-average action-value estimates, and initial estimates of )(a) = 0 for all a Suppose the initial sequence of actions and rewards is A-2, R-2, A2-1, R2-5, As-3, R3-3, A4-1, R4-4, As- 4, R5-3, A.-2, R.--1. On some of these time steps the case may have occurred causing an action to be selected at random. On which time steps did this definitely occur? On which time steps could this possibly have occurred