Consider the following grammar: S baSab | baS | b Consider again the grammar in the previous question (Question 8), augmented with a new start symbol and a production that includes an end-of-input marker: S' S$ S + ba SabbaS b Recall that the algorithm for constructing a simple recursive descent parser given in the lecture videos tries the productions in a particular order when trying to parse an input string. What order of the S productions results in the fastest time to parse the string 'babab' using the simple recursive descent strategy? Assume that the input is appended with an end-of-input marker $. OS baSab | b | bas OS +bba SabbaS OS+bas | baSabb OS+bbas | baSab OS baS | 6 | ba Sab OS ba Sab | baS b