Please answer in neat format and good explanation. The question is as follows:

4. a. Find a recurrence relation F (with appropriate initial values) for the number of ways to arrange flags on a flagpole that is n feet tall using flags of the following four types: red flags which are three feet high white flags which are two feet high blue flags which are one foot high yellow flags which are one foot high b. Calculate F using your recursive formula from part a. c. List explicitly all the possible flag arrangements of height 4. (Of course, your answers to parts b and c should agree.) Be organized in your listing and also number your arrangments. While there are quite a few arrangments, if you make use of the recurrence relation, it should be easy to organize your list