Consider the HMM on the right. "Rainy" and "Sunny" are hidden states. "Walk", "Shop", "Clean" are observations. a$.$ Using the Forward Algorithm, compute the probability of observation sequence $[$Clean$,$ Shop, Walk$].$ Start $0\mathrm{.}40\mathrm{.}6$ Rainy $0\mathrm{.}30\mathrm{.}4$ Sunny $0\mathrm{.}60\mathrm{.}1$ b$.$ Using the Viterbi Algorithm, find the most likely sequence of hidden states if we are given the observation sequence $[$Clean$,$ Shop, Walk$].$ Walk Clean Shop For both $($a$)$ and $($b$)$ above, draw their trellis, and show the alphas $($Forward Algorithm$)$ and v$\text{'}$s $($Viterbi Algorithm$),$ similar to the examples on the slides.