Olympiad Number Theory · Superchallenge problem

Determine the multiplicative order of $2$ modulo $49$ – that is, the smallest positive integer $k$ with $2^k \equiv 1 \pmod{49}$.