![5. Let Cn be the cycle on [n] with an edge between i and j if and only if i-j +1 mod n. Draw C4 and then draw all spanning forests on C4 with exactly 2 trees. Explain why the number of spanning forests of Cn with exactly k trees is (](https://d2vlcm61l7u1fs.cloudfront.net/media%2F801%2F80199409-e940-4b78-ac28-9f76aa6370b0%2FphpLpdbSd.png)
5. Let Cn be the cycle on [n] with an edge between i and j if and only if i-j +1 mod n. Draw C4 and then draw all spanning forests on C4 with exactly 2 trees. Explain why the number of spanning forests of
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured