Create an attack tree for getting into a gym without paying. Which attack do you think is most likely? Assign a probability value (e.g., high, low, or 30%) to each node.

Important: minimum requirement for each attack tree:

Has at least three different attacks (second-level nodes)

Has at least one attack with a path at least three subnodes deep

Has at least two attacks that have subtasks with at least two immediate children

Answers all questions and justifies rankings and answers. E.g., We think that attack ____ would be the easiest because _____, whereas _____ would not be as easy because _____.