Decomposability index of tournaments

Given a tournament $T$, a module of $T$ is a subset $X$ of $V\left(T\right)$ such that for $x,y\in X$ and $v\in V\left(T\right)?X$, $(x,v)\in A\left(T\right)$ if and only if $(y,v)\in A\left(T\right)$. The trivial modules of $T$ are $?$, $\left\{u\right\}$ $(u\in V\left(T\right))$ and $V\left(T\right)$. The tournament $T$ is indecomposable if all its modules are trivial; otherwise it is decomposable. The decomposability index of $T$, denoted by $\delta \left(T\right)$, is the smallest number of arcs of $T$ that must be reversed to make $T$ indecomposable. For $n\ge 5$, let $\delta \left(n\right)$ be the maximum of $\delta \left(T\right)$ over the tournaments $T$ with $n$ vertices. We prove that $?\frac{n+1}{4}?\le \delta \left(n\right)\le ?\frac{n?1}{3}?$ and that the lower bound is reached by the transitive tournaments.