Discrete structures for computer science

Problem 1: Consider the following expression in propositional logic. Rewrite this expres- sion so that all operator precedence is disambiguated using brackets. p A q v r -> - ph -qProblem 2: Translate each logical sentence into a natural English sentence (parts ash) and each English sentence into a logical sentence (parts cid). Use the following propositional functions, Where the inputs are drawn from the domain of all cups of coffee. 0 S(x, y) E x is stronger than 3; I 1(32) E :c is iced o B(:c) E bill likes a: (a) 3wa[3(31, ml] 0)) st[1(sv) > 3y(B(y) A 3(yax))] (c) Hot coffee is always stronger than iced coffee. ((1) bill likes any coffee stronger than Dunkin