Given an arrayAof positive integers (not necessarily distinct), return the lexicographically largest permutation that is smaller thanA, that can be made with one swap (Aswapexchanges the positions of two numbersA[i]andA[j]). If it cannot be done, then return the same array. Example 1: Inpu...