Question 63
An independent set of a graph $G$ is a set of vertices of $G$ such that no two vertices among these are connected by an edge. If $G$ has $2000$ vertices, and each vertex has degree $10$, find the maximum possible number of independent sets that $G$ can have.