1. Please give an unambiguous context-free grammar for the logic expressions satisfying the following properties?
   1. The only terminal symbol is represented by which denotes a boolean value.
   2. There are two binary operators: logic AND and logic OR which should be represented as && and || respectively.
   3. The only unary operator is the logic NOT, which should be represented as !.
   4. The operator precedence is defined as ! > || > && , i.e., logic NOT is higher than logic OR, and logic OR is higher than logic AND.
   5. Both of the binary operators are right associative.