ou CANNOT use recursion to implement these functions. You MUST use a STACK BASED implementation.

1.1 The test questions There are three functions that you need to study for the test. For your test, you will be given one of these to code up. In all cases, you can assume that input is purely alphanumeric and that the argument k > 0. List allAnagrams (string input). An anagram of a string is just a permutation of the string. You must write a function that produces all anagrams of the input string in a list. The order does not matter. For example, if the input string was "abc", the function should output a list containing the following strings: abc, acb, bac, bca, cab, cba