E. Full solution.
We first show that ten unit segments are impossible. If all ten segments had length \(1\), then triangles \(OAB\), \(OBC\), \(OCD\), \(ODE\), and \(OEA\) would all be equilateral.
Hence each of the angles \(\angle AOB\), \(\angle BOC\), \(\angle COD\), \(\angle DOE\), and \(\angle EOA\) would be \(60^\circ\). Their sum around point \(O\) must be \(360^\circ\), but it would be \(5\cdot60^\circ=300^\circ\), a contradiction. Thus at most nine are possible.
Now construct an example with nine. Take a regular hexagon of side \(1\) with center \(O\). Choose five consecutive vertices as \(A,B,C,D,E\). Then \(O\) lies inside the pentagon.
In this example all five segments \(OA,OB,OC,OD,OE\) are equal to \(1\), and four sides \(AB,BC,CD,DE\) are also equal to \(1\). The remaining side \(EA\) is not \(1\). Therefore the maximum is exactly nine.