JAVA. Determine the minimum number of swaps to sort 3 integers so that they are ordered in ascending order (from low to high).

Input The program reads in three (unordered) integers: i, j and k. Processing Calculate the minimum number of swaps that it would take to sort the three integers into ascending order. Output that number. Output Output "Minimum swaps: "followed by the computed value. The text must be terminated by a new-line character. Examples Sample Input Sample Output Minimum swaps: 1 Minimum swaps: 1 Minimum swaps: Minimum swaps: 2 11 2 14 31 64 72 0 98 12 57