Question: 1. After determining which colors are present in the hidden peg sequence, we know that there are at least two colors not present (because there are six possible colors and only four positions for pegs). Let C be a color that is present in the sequence, and let N be one of the colors that is not present. What information is gained from the guesses CNNN, NCNN, NNCN, and NNNC?
2. Using the ideas developed in the previous two questions, write an algorithm that takes no more than 11 guesses.