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.

answer with step-by-step explanation:

a. ∠j is supplementary to ∠k - true:

(opposite angles of a trapezoid are supplementary which means that they add up to 180 degrees)

b. kl is parallel to jm - true:

(opposite sides are parallel to each other in a trapezoid)

c. jk is perpendicular to kl - false:

(clearly, jk does not make a right angle with kl)

d. jk is parallel to lm - false:

(jk and lm are two lines opposite in direction to each other so they cannot be parallel)

e. ∠j is congruent to ∠m - true:

(the angles on each side of the base are congruent)

f. ∠j is congruent to ∠k - false:

(the angles on the same side but opposite side of the base are not congruent)

no association

step-by-step explanation:

if you have eyes and you can use them efficiently you can see that it just looks like random dots like do a line of best fit and like they're so spread out it's such a weak association you might as well consider it nonexistent

step-by-step explanation: