Write a function cyclic_toptail() which takes a single argument sentence in the form of a non-empty string, and returns True if ll words in sentence start with the final letter of the word that precedes them (including the first letter of the first word being the same as the last letter of the last word), and False otherwise. You may assume that sentence is all lowercase, does not contain any punctuation, and that words are separated by spaces. For example, in the case of sentence being "giraffes sing", the function should return True, as: (a) the first word ("giraffes") ends in the same letter as the first letter of the second word ("sing"), i.e. s; and (b) the first letter of the first word is the same as the last letter of the last word, e.g. g. In the case of "giraffes sulk", on the other hand, the function should return False, as the first letter of the first word (g) is not the same as the last letter of the last word (k). Example calls to the function are: >>» cyclic_toptail("giraffes sing") True >>> cyclic_toptail("giraffes sulk") False >>> cyclic_toptail("seals slurping green negronis") True >>> cyclic_toptail("abracadabra") True >>> cyclic_toptail("alakazam") False >>> cyclic_toptail("the cat sat on the mat") False

1. a.Palindromes Complete the function palindrome(String text). Return true if text is a palindrome; if the word is identical forward and backward. Otherwise, return false. Example:  palindrome(“racecar”) == true palindrome(“kayaks”) == false See main() for more examples. You can use text.charAt(i) to find the character at index i of text. Use recursion. palindrome() should call itself. No loops allowed. b. Complete the function nestedBrackets(String s). This function should find properly nested brackets within s. Return true if brackets are opened and closed correctly, and false otherwise.  Single pairs and nested pairs are valid. For example: z[z]z, [zz[zz]z], [z[[z]zzz]], zzzzz Incorrect pairings and multiple separate pairs are not valid. For example: zz[zz, ]zzz[, [zzz][z], [z[z][z]z] See main() for more examples. nestedBrackets() should call firstIndexOf() and lastIndexOf() to help you solve the problem. Use recursion. nestedBrackets() should call itself. No loops…

Define a function RemoveCommas() that takes a string parameter and returns a string. The returned string is the parameter with all of the commas removed. Ex: RemoveCommas("mouse,toy,fox,bear,pet") returns "mousetoyfoxbearpet" Recall string's size() returns the number of characters in a string. Ex: myString.size() string's at() returns a character at the specified position in the string. Ex: myString.at(3)   #include <iostream>#include <string>#include <cctype>using namespace std; /* Your code goes here */ int main() {   string input;   string output;    getline(cin, input);        output = RemoveCommas(input);      cout << output << endl;    return 0;}

Define a function named get_encrypted_list (word) which takes a word as a parameter. The function returns a list of characters. The first element is the first letter from the parameter word and the rest is as a sequence of '*', each '*' representing a letter in the parameter word. Note: you can assume that the parameter word is not empty. For example: Test Result ['h', '*', **1 guess = get_encrypted_list('hello') print(guess) print (type (guess)) guess = get_encrypted_list('succeed') ['s', '*', print (guess) **¹, ¹*¹] **']