$($a$)$ Write any one use$-$case $($application$)$ which can be modeled as a multi$-$armed bandit for its solution. Your answer should have all the elements that identify the use case and can be modeled as a multi$-$armed bandit problem.

$($b$)$ White down a bandit algorithm that is x$-$greedy. $($Note: only a formal algorithm pseudo$-$code will be accepted as an answer.

Comment on the efficiency of this algorithm.

c$)$ How does this algorithm balance exploration vs exploitation trade$-$off?