The four-node network shown in Fig. P3 is assumed to be a complete graph (all possible edges are present). Assume that all edge reliabilities are 0.9. (a) By enumeration, find all the trees you can...

The four-node network shown in Fig. P3 is assumed to be a complete graph (all possible edges are present). Assume that all edge reliabilities are 0.9.

(a) By enumeration, find all the trees you can define for this network.

 (b) By enumeration, find all the Hamiltonian tours you can find for this network.

(c) Compute the all-terminal reliabilities for the tree networks.

(d) Compute the all-terminal reliabilities for the Hamiltonian networks.

 (e) Compute the two-terminal reliabilities R_AB
for the trees.

(f) Compute the two-terminal reliabilities R_AB
for the Hamiltonian tours.