1. Review the lecture slides which discuss Very Simple Programming Languages (VSPL). Next, observe the VSPL defined below and identify which sequences are valid. ::= the | a | that this ::= book | flight | game love football ticket ::= love book | win | buy | enjoy ::= you he | she || [them ::= Phoenix | Tempe ASU ::= do does ::= from | to on near | through ::= ::= | | ::= | | ::= | | ::= | | Which of the following are valid sequences? You must clearly identify for each of the following sequences, which are valid, and which are invalid. Each sequence is worth 1 point. Submit your answer as hw02q1.pdf. (10 points) 1. buy the ticket to Phoenix 2. Tempe win from Phoenix to 3. he does buy the book 4. you buy love through that game 5. does I enjoy football 6. from this flight to that flight 7. ASU win the football 8. does I book that 9. does buy game 10. he love them