Generating minimally transitive permutation groups

We prove that each minimally transitive permutation group of degree n can be generated by μ(n)+1 elements, where μ(n):=max⁡{m:there exists a prime p such that pm divides n}.