4.) (20 points) Write a grammar that a logic solver may implement. The terminals are: T, F, ^, v, -, (, ) Make sure to express the precedence that (not) is higher than ^ (and) is higher than v (or) in your grammar