$$U$\text{'}$S$\text{'}$I$\text{'}$IUINS

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 $"$

We think that tailgating behind a legitimate member would be the easiest attack because it requires minimal effort and resources, simply relying on exploiting the physical security vulnerabilities of the gym$\text{'}$s entrance. Whereas, manipulating the receptionist by creating a distraction would not be as easy because it involves orchestrating a complex scenario, potentially requiring the involvement of multiple actors and careful planning to divert the receptionist's attention effectively.

This will let you easily create something like this: