urnisha09 urnisha09 13-03-2020 Computers and Technology contestada 1. Given two numbers, n and k ( 0< n, k <=12), generate all the pemutations taking k letters from n letters (nPk) considering first n small alphabets. 2. Use the idea of backtracking (recursion).
