Suppose an elevator is controlled by two commands: ↑ to move the elevator up one floor and ↓ to move the elevator down one floor. Assume that the building is arbitrarily tall and that the elevator starts at floor x. Write an LL(1) grammar that generates arbitrary command sequences that

(1) never cause the elevator to go below floor x and
(2) always return the elevator to floor x at the end of the sequence. For example, ↑↑↓↓ and ↑↓↑↓ are valid command sequences, but ↑↓↓↑ and ↑↓↓ are not. For convenience, you may consider a null sequence as valid. Prove that your gram.

(50 ) mrs. julien’s and mrs. castillejo’s classes are selling cookie dough for a school fundraiser. customers can buy packages of macadamia nut chip cookie dough and packages of triple chocolate cookie dough. mrs. julien’s class sold 25 packages of macadamia nut chip cookie dough and 30 packages of triple chocolate cookie dough for a total of $221.25. mrs. castillejo’s class sold 5 packages of macadamia nut chip cookie dough and 45 packages of triple chocolate cookie dough for a total of $191.25. (a) write the system of equations that model the problem. be sure to explain which equation represents which situation. (b) find the cost of each type of cookie. show your work. (c) explain which method you used to solve the system and why you chose that method.