QUESTION 10 What is the language recognized by the NFA below? All strings of the form ok where k is an integer multiple of 2 along with all strings of the form 1P where p is an integer multiple of 3. All strings of the form 1 Pok where p is a non-negative integer multiple of 3 and k is a non-negative integer multiple of 2. None of the above. The diagram does not represent a valid NFA