O Design an algorithm to find all the permutations of an array having n unique elements. Give a trace for permutations(A,n), where A={1,2,3} and n=3. Design a recurrence relation for the algorithm and...

Extracted text: O Design an algorithm to find all the permutations of an array having n unique elements. Give a trace for permutations(A,n), where A={1,2,3} and n=3. Design a recurrence relation for the algorithm and find its time complexity. Give a proof of correctness.