Problem 6. The school Parking Lot (10 points) To help with parking issues, the school has just created a new parking lot consisting of n spaces in a single long row. Rather than creating separate spots for motorcycles and cars, make all n spaces small, such that motorcycles will occupy one space and cars will occupy two. Write a recurrence P(n), counting the number of possible ways to park cars and motorcycles in this parking lot such that the lot is full. Specifically, for a full lot we can write a string mccmmmcmc.. representing the left to right ordering of appearance of 'm'otorevcles and'cars, and we wish to count the number of distinct strings which represent a full lot. For simplicity, you can assume P(O) 1. Hint: The recurrence should have a simple form. Also, don't forget to include base cases. management decided to