On computing the closures of solvable permutation groups

Let $m\ge 3$ be an integer. It is proved that the $m$-closure of a given solvable permutation group of degree $n$ can be constructed in time $n^{O(m)}$.
Comment: 7 pages