What general form can the rules of a context-sensitive grammar
take?

Answer: Two possible answers: here is one - rules must be of the
form λAρ → λσρ where λ and ρ
are (possibly empty) strings of alphabet symbols, A is a non-terminal,
and σ is a string of alphabet symbols.