these questions are for Data Mining. my professor went over them this week but he was really unclear on the board when he was going over them. as you can see, question one is complete, I need the rest of the two to be complete to understand it for this week's exam. any help would be greatly appreciated.

Here is the Hidden Markov model for the Dishonest Casino problem. A casino has two dice: Fair die P(1)-P(2) P(3) P4) P(5) P(6 1/6 -Loaded die P(1) P(2) -P(3) P(4) P(5) 1/15 P(6) 2/3 The Transition probability (switching between fair and loaded die) is 0.15 Note, use base 2 for all the log calculation. Q1, Draw the FSA (finite state automata) for this Hidden Markov model. fai r loade Q2, Given the HMM, and a sequence of rolls by the casino as following: 6, 2, 4,6, 2, 3, 6, 1, 2, 1, 5, 6, 2, 1, 4 What is the probability of states Fair, Fair, Fair, Fair, Fair, Load, Load, Load, Load, Fair, Fair, Fair, Fair, Fair, Fair