Generation of Generalised Wreath Products of Symmetric Groups

Let I be a finite partially ordered set and let (Sym(Δi),Δi)i be a sequence of symmetric groups indexed by I. Construct the generalised wreath product (F, Δ) on this sequence of permutation groups. We determine the minimum number d(F) of generators required for this generalised wreath product.