Permutations using backtracking

#1

How’s the time complexity turns out to be O(n*n!) ?
can you explain?

#2

Note that there are n! permutations and it requires O(n) time to print a a permutation.So it is O(n*n!)

#3

How does it require O(n) to print a permutation?

#4

If the length of string is n,then we need to print n characters.So O(n) complexity.