HW9: ==== Pick 6 of the following 9 programming projects (located in the textbook and also described below). All problems have equal weight. Your grade will not be affected by the problems that you pick. * RQ 7, p. 561 (5-th ed, p 547) * PP 2, p. 562 (5-th ed, p 548) * PP 3, p. 562 (5-th ed, p 548) * PP 4, p. 562 (5-th ed, p 548) * PP 5, p. 563 (5-th ed, p 548) * In the language of an alien race, all words take the form of Blurbs. A Blurb is a Whoozit followed by one or more Whatzits. A Whoozit is the character 'x' followed by zero or more 'y's. A Whatzit is a 'q' followed by either a 'z' or a 'd', followed by a Whoozit. Design and implement a recursive program that generates random Blurbs in this alien language. * Write a recursive function that takes a string and reverses it. * Design and implement a recursive program to determine and print the Nth line of Pascal's Triangle, as shown below. Each interior value is the sum of the two values above it. Hint: use an array to store the values on each line. 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1 1 7 21 35 35 21 7 1 * Design and implement a recursive program that solves the Non-Attacking 8 Queens problem. That is, write a program to determine how eight queens can be positioned on an eight-by-eight chessboard so that none of them are in the same row, column, or diagonal as any other queen. There are no other chess pieces on the board. Hint: For 8-queens there are a total of 92 solutions. If we exclude symmetry, there are 12 solutions. See also: http://en.wikipedia.org/wiki/Eight_queens_puzzle