IsPal funciton Implement the recursive function isPal(), which determines whether a string str is a simple palindrome.

A simple palindrome is a string consisting entirely of the characters a-z that reads the same forward and backward. For instance, the upcoming are palindromes: dad, level, mom, madamimadam, . Use the following declaration of isPal(): bool isPal (const string& str, int startIndex, int endIndex);

It returns true when the substring in the index range [startIndex, endIndex) is a palindrome. The conditions are Stopping Condition: Result is true when startIndex >= endIndex -1 Result is false when str[startIndex] != str[endIndex-1]

Recursive Step: Determine whether the substring of the str in the index range [startIndex+1, endIndex-1] is a palindrome

Write the command that can be used to answer the following questions. (hint: try each out on the system to check your results.) a. find all files on the system that have the word test" as part of their filename. b. search the path variable for the pathname to the awk command. c. find all files in the /usr directory and subdirectories that are larger than 50 kilobytes in size. d. find all files in the /usr directory and subdirectories that are less than 70 kilobytes in size. e. find all files in the / directory and subdirectories that are symbolic links. f. find all files in the /var directory and subdirectories that were accessed less than 60 minutes ago. g. find all files in the /var directory and subdirectories that were accessed less than six days ago. h. find all files in the /home directory and subdirectories that are empty. i. find all files in the /etc directory and subdirectories that are owned by the group bin."

State 7 common key's for every keyboard

From excel to powerpoint, you can copy and paste a. cell ranges and charts, one at a time. b. cell ranges and charts, simultaneously. c. charts only. d. cell ranges only.