Task 1.1 1) Design and write a unanimous BNF of extended PAM allowing complex conditional expressions in branching and loop operators that are built from comparisons (as in original PAM grammar) by binary logical connectives (equivalence), => (implication), or (disjunction), xor (exclusive or), and and (conjunction), and unary logical connective not (negation). Extension of BNF meta-notation by the symbol for alternatives and by the regular expressions is allowed. Specify that the operations increase their binding strength in the following order: (the weakest binding). => or and xor with the same binding strength, and (the strongest binding). For instance, 2=3 and 3=4 or 5-5 shall be interpreted the same, as (2=3 and 3=4) or 5=5 since and binds stronger than or. The use of parentheses must be allowed within the expressions to specify any order of evaluation. Specify that , and, or and xor are left-associative, and => is right-associative