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 ::= love | book | win | buy ::= you | he | she | I ::= Phoenix | Tempe ::= 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. he buy the book 2. does the love win 3. through Phoenix I win on flight 4. book through Tempe 5. I do love this game 6. this Tempe win the game 7. does love this book 8. I buy this game near Tempe 9. book Phoenix through the game 10. the game near this flight book you