i have just started discrete maths at uni and we have been given this

"Use the laws of logic to rewrite the following expressions and determine whether each is a tautology, contradiction or neither

a) (p or q) or (-(p and (q -> p)) or r)))

b) (((p -> r) -> p) and q) and (-((p -> r) ->p))"

we have only been told the rules and not how to use them, yet this question is in an assignment, can someone go through this as simply as possible using the names of the rules, thanks