In Java only please:

Given a complete binary tree with N nodes and each node have a distinct integer ai attached with it, find the minimum number of swaps you can make to convert the binary tree into binary search tree.

Given a complete binary tree with N nodes and each node have a distinct integer ai attached with it, find the minimum number of swaps you can make to convert the binary tree into binary search tree. In one swap, you can select any two nodes and swap their values. You will be given the array representation of the binary tree. Root of the tree will be at ao Left child of root will be at a1 and right child of root will be at a2. Left child of node at array position k will be at a2%+1 and right child of node at array position k will be at a2%+2. Input format: First line contains an integer, N (1SNs105), denoting the number of nodes. Second line contains N space separated integers, a (1sas105), denoting the value attached to ith node. Output format: Print a single integer, denoting the minimum number of swaps needed to convert binary tree into a binary search tree. Sample Input: 1 23 Sample Output: 1 Explanation We need only one swap (1,2) to convert the given binary tree into binary search tree. 2 3 After swapping (1,2) 2 3