P3 (25pt): (a) (15pt) Given an array of distinct integers A[1...n), design an algorithm to print out all permutations of the array. (b) (10pt) Given an array of integers A[1...n] with possible duplicates, printout all unique permutations of the array. [Describe your algorithm only; no need to prove correctness or analyze complexity)