What is the time complexity for these two programs and why is that time complexity?

A$.)$

public static void printPermutations$($char$[]$ arr, int index$)\{$

if $($index $==$ arr.length $-1)\{$

$$ System.out.println$($new String$($arr$))$;

$\}$else$\{$

$$ for $($int i $=$ index; i $<$ arr.length; i$++)\{$

$$ swap$($arr$,$ index, i$)$;

$$ printPermutations$($arr$,$ index $+1)$;

$$ swap$($arr$,$ index, i$)$;

$\}$

$\}$

$\}$

B$.)$

public static void swap$($char$[]$ arr, int i$1,$ int i$2)\{$

$$ char temp $=$ arr$[$i$1]$;

$$ arr$[$i$1]=$ arr$[$i$2]$;

$$ arr$[$i$2]=$ temp;

$\}$