A student can only pass a course so long as they meet the following lab

attendance criteria:

They missed fewer than $2$ labs

They were never late for $3$ consecutive labs

Demonstrators record a string representing a student's track record $-\text{'}A\text{'}$ for

absent$,\text{'}L\text{'}$ for late, $\text{'}P\text{'}$ for present

Write a recursive program that takes in one of these strings and outputs

whether the student should fail or not. If you can't think of how to do it

recursively then just do it in any way!

Example $1$:

Input: PPALLP

Output: PASS

Explanation: The student has fewer than $2$ absences and was never late for $3$ or

more consecutive labs

Example $2$:

Input: PPALLLPPPPPPP

Output: FAIL

Explanation: The student was late $3$ for consecutive labs