$$\text { The pseudocode of a function fun( ) is given below : }$$

 fun(int A[0, .., n-1]) {
    for i = 0 to n-2
        for j=0 to n-i-2
            if (A[]]>A[j + 1])
                then swap A[j] and A[j+1]
}

Let $A[0, \ldots, 29]$ be an array storing 30 distinct integers in descending order. The number of swap operations that will be performed, if the function fun( ) is called with $A[0, \ldots, 29]$ as argument, is _________. (Answer in integer)

Let $A$ be an array containing integer values. The distance of $A$ is defined as the minimum number of elements in $A$ that must be replaced with another integer so that the resulting array is sorted in non-decreasing order. The distance of the array [2, 5, 3, 1, 4, 2, 6] is __________

Consider the following array.