I'm confused with converting english statements to predicate logic, if you could help for these. thanks! this is a discrete math problem in computer science.

The teams in the National Hockey League (NHL) are grouped into divisions. The Stanley Cup is the trophy awarded to the winner of the league each year. Here are some sets and predicates used to model the NHL: Symbol T D Belongs To(t,d) Stanley(t) Canadian(t) Definition the set of all NHL teams the set of all division names "team t is in division d," where te T and de D "team t has won a Stanley Cup," where tET "team t is Canadian," where tET Using these sets and predicates, the symbols = and +, and the standard propositional operators and quantifiers from lecture, translate each of the following English statements into predicate logic. (a) No Canadian team has won the Stanley Cup. (b) There is a division that contains only non-Canadian teams. (c) All teams that have won the Stanley Cup belong to the same division. (d) Every team is in exactly one division. (Hint: use = and/or #) (e) Every division contains exactly two different teams. Scanned with CamScanner