1. Show that for a fully connected ORD having only association edges and with four or more nodes, the number of stubs generated by Procedure TD is 2. 2. Suggest a method for breaking cycles in...

1. Show that for a fully connected ORD having only association edges and with four or more nodes, the number of stubs generated by Procedure TD is 2.

2. Suggest a method for breaking cycles in clusters of classes formed when applying procedure TD. Apply your method to a fully connected ORD with six nodes and only association edges. Compare the number of stubs generated with that obtained by applying the TJJM and BLW methods.