Suppose we have a Markov chain that models the spread of a flu virus with population n. Each pair (i,j) comes into contact with each other with probability p and infects each other. Also, any person infected for at least 24 hours will recover with probability 0 < q < 1, and return to being susceptible.

Draw a markov chain with as few states as possible to model the spread of the flu for n = 2, and identify all recurrent states.