Item 2.

Find a subgraph with the largest number of edges that doesn't contain any cycles.