Please see an attachment for details (C) An algorithm A takes a list 5, of n distinct elements, 11 3? 3 and prints all the 3-permutations on S, onepermutation per line. How many lines will be printed if the list has: (a) (i) n elements (ii) 11 + 1 elements (1))Suppose we had a list 5 of n elements and printed all the permutations. If we then added another Show more Show more Engineering & Technology Computer ScienceCOMP 3310
