Pick all statements that apply to this graph. a e h f You must remove at least 2 arcs to make this graph not connected. This is a simple graph. No node has degree 5. Removing 3 arcs is enough to make this graph acyclic. This graph has an Euler path since more than 2 nodes have degree 3