Consider the $10-$armed bandit problem we discussed in the class. Assume we apply the $-$

greedy method to choose the actions. Please compare the results $($bandit average score$)$

for $=0\mathrm{.}4,=0\mathrm{.}1,$ and $=0\mathrm{.}01.$

Note: the reference MAB Experiments Epsilon Greedy$\_$Spring$\_2024.$jpynb darr is an

example of multi$-$arm bandit with $=0\mathrm{.}1.$ Please include the comparison in a single

figure and analyze the impacts of $$ value.

Submission: Please submit your code $(.$ipynb$)$ along with the comparison figure and

analysis.