Create an attack tree for learning someone's online banking account name and password.

Assign Riyal values to each attack node. Which attack is cheapest for the attacker? Which attack is most expensive?

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.

I'his will let you easily create something like this: