A (not necessarily connected) graph without cycles is called a forest. Give

A (not necessarily connected) graph without cycles is called a forest. Give typical examples of applications in which graphs occur that are forests or trees.

PROBLEM SET 23.3: