[Linux c++] Hi , I ask the same question three times, but their answer is not correctly,

I need question a and question b answer , thank you .

4. Every year before the Academy Awards, cinephiles Mike, Tom, and Crow have a movie watching marathon and mini awards show to decide on a Best Picture for the previous year. This year, there are three candi- date movies in the hunt for their Best Picture award: the spy thriller, Agent for H.A.R.M., denoted by A; the gritty character-driven drama, Brute Man, denoted by B; and the visually stunning sci-fi blockbuster, Creeping Terror, denoted by C. After watching and discussing all three movies, each person's preferences are as follows: Mike prefers A to B and prefers B to C. Tom prefers C to A and prefers A to B. Crow prefers B to C and prefers C to A. Since they seem to be stuck, they agree to have a vote. Here's how it will work. Each person writes their selection for best picture on a ballot. If one movie receives more votes than the others, it wins the award. If there is a three way tie in which each movie gets a single vote, then Mike (as the host) breaks the tie. (Note: Mike doesn't get to vote again in the case of a three way tie, but rather whatever he voted for in a three way tie would be the winner.) Assuming that all three movie lovers are perfectly rational, and each knows the preferences of the other two, we would like to determine how each of them would vote. a. (3 marks) For each individual, determine which of their strategies are strictly or weakly dominated. b. (2 marks) After eliminating the dominated strategy/strategies, which strategy/strategies can you now eliminate? What will be the result of the vote