Edit re the close as duplicate: I think it should be the other way around. the not order 6 seems to be answered with the answer for at most order 9. i propose this be reopened and the other closed.
Let $H$ be a group with identity $1_H$ that is generated by 2 elements $a,b$ that commute ($ab=ba$) and where each has order $3$ or $1$. In symbols (I hope I translated correctly):
$$H=\langle a,b\rangle \ \text{, where} \ a^3=b^3=1_H=a^{-1}b^{-1}ab$$
I'm supposed to show $H$ has at most order $9$. This is easy to do when we don't have all of $\{a,b,1_H\}$ to be distinct. As for all distinct, I get the $3 \times 3$ multiplication table to give other elements $a^2,b,ba,ba^2,b^2,b^2a,b^2a^2$. Then I can construct a $9 \times 9$ multiplication table to show that we don't get any new elements. Is this a shorter way to do this?