Consider A and B defined as follows 2n-2j 2j s A when n 3? s B when n 3? Give a combinatorial proof of the following identity: 1n + 6n 3 1n 2 Consider the simple undirected graph G (V,E) wit any different laheled induced suheranhs does G have