Consider the attack tree shown below. The integer outside a circle represents the node ID and integer inside a circle represents the cost of an attack is attempted on the node.

(1) Identify all the possible paths (i.e., the sequence of nodes in each path) for the attack tree. For clarity, label each path with a unique number. (8 marks)

(2) For each of the paths identified, compute the cost for the attack leading to the root node Based on the paths, and the probability of apprehension determined, identify the paths according to each of the following criterion:

(i) The most expensive path. (3 marks)

(ii) The least expensive path. (3 marks)

(iii) The attack path that involves the maximum # of leaf nodes (break any tie by choosing the most expensive path). (3 marks)

(iv) The attack path that involves the minimum # of leaf nodes (break any tie by choosing the least expensive path). (3 marks)

4 2 1314 15 7 12 3 2 17 18 19 10 4 4 2 1314 15 7 12 3 2 17 18 19 10 4