First program accepts as an input a permutation and prints the permutation rank in the lexicpgraphic order of all same length permutations. Second program accepts two integers n and k as inputs and prints the permutation of [n] which is at position k in the lexicographic order of all its permutations of [n].