Write, in C#, Python, or Ruby, an iterator that yields (a) all permutations of the integers 1 ..n (b) all combinations of k integers from the range 1 ..n (0 ≤ k ≤ n). You may represent your permutations and combinations using either a list or an array.

This is loosely based on a program in Python for a sub-list sorting program. What are the coupling and cohesion levels in each function block in this structure chart, and explain what makes them that type of coupling and cohesion:.

Given a file of unsorted words with mixed case: read the entries in the file and sort those words lexicographically. The program (in c++) should then prompt the user for an index, and display the word at that index. Since you must store the entire list in an array, you will need to know the length. The "List of 1000 Mixed Case Words" contains 1000 words. You are guaranteed that the words in the array are unique, so you don't have to worry about the order of, say, "bat" and "Bat."

Implement a function void printAll(void) to print all the items of the list.