Markov Chain States

A Markov chain describes probabilities of transitioning between states. Given a starting state, transition probabilities, and a number of steps, simulate the chain and return the count of visits to each state. Input: first line start state and num_steps, second line n (number of transitions), then n lines "from to probability", then seed. Output: counts for each state visited.