There are two elements $$x, y$$ in a group $$\left( {G,\, * } \right)$$ such that every elements in the group can be written as a product of some number of $$x's$$ and $$y's$$ in some order. It is known that
$$x * x = y * y = x * y * x * y = y * x * y * x = e$$
where $$e$$ is the identity element. The maximum number of elements in such a group is ______.

let $$G$$ be a group with $$15$$ elements. Let $$L$$ be a subgroup of $$G$$. It is known that $$L \ne G$$ and that the size of $$L$$ is at least $$4$$. The size of $$L$$ is ______.

Let $$\delta $$ denote the minimum degree of a vertex in a graph. For all planar graphs on $$n$$ vertices with $$\delta \ge 3$$, which one of the following is TRUE?

If $$G$$ is a forest with $$n$$ vertices and $$k$$ connected components, how many edges does $$G$$ have?