write a program in either Python 3 or Java (your choice) that uses several recursive algorithms to compute a property that I am calling the "Camel Acrostic" of a list. The "Camel Acrostic" of a list of strings is the "word" that would be created if the elements of the list were written in "camel case" and then the capital letters were extracted and combined into a single string. (Please note that, for the purposes of this assignment, the term "camel case" refers to the capitalization of every word EXCEPT the first in the sequence.) As a clarifying example, the list of words: ["is", "tHis", "eXaMPLe", "SUFfIcIEntLY", "TELliNg"] would be written in "camel case" as: isThisExampleSufficientlyTelling and would have a "Camel Acrostic" of: