An attacker has connected to an unused VoIP phone port to gain unauthorized access to a network. This is an example of which of the following attacks?

What color is the Microphone input?

A. light blue B. lime C. black D. orange E. pink

Your method need not check that the string is a correct English phrase or word. Embed the method in a program, and test it.

A palindrome is a string that reads the same forward and backward, such as "radar". Write a static recursive method that has one parameter of type String and returns true if the argument is a palindrome and false otherwise. Disregard spaces and punctuation marks in the string, and consider upper- and lowercase versions of the same letter to be equal. For example, the following strings should be considered palindromes by your method: "Straw? No, too stupid a fad, I put soot on warts." "xyzcZYx?" The algorithm for this Project is a bit tricky. The recursive algorithm leads to some inefficiency. For example, the problem statement asks for a method that takes a string with spaces and punctuation, but only looks at the letters and returns a Boolean value. So the method must parse the input string and eliminate everything but letters. Although the string needs to be parsed just once, a recursive algorithm must be identical each iteration, so the parsing occurs each iteration. The base case either returns TRUE if the string has zero or one characters, or, if the string has two or more characters, it checks the first and last characters and has a more complex algorithm to determine whether to return TRUE or FALSE. If the two letters (the first and last) are different it returns FALSE. But it the two are the same, it returns the result of a recursive call with a smaller string, with the first and last letters removed. So each iteration reduces the string by a pair of letters until the string is down to zero or one character (even or odd number of letters, respectively, in the original string). The base case returns TRUE and starts unraveling the stacked method calls. The base method always returns TRUE, but each return after that ANDs it with the Boolean result of the test for a pair of letters that must be the same if it is a palindrome. If any pair is not equal, a FALSE is ANDed and, by definition of the AND operation, the result will be FALSE. The method, after all iterations are done, will return TRUE only if every iteration returned TRUE (the letters in each pair were the same). An alternative approach would be to write a second recursive method that looks at each character in the string recursively and appends it to the result if it is not space or punctuation.