in computing algorithms, Given $11$ elements: $\{$x$1,$ x$2,$ x$3,$ x$4,$ x$5,$ x$6,$ x$7,$ x$8,$ x$9,$ x$10,$ x$11\},$ it is known that x$6$ is not in place. What is the maximum number of inversions in this array?