We can define an alphabet as a set of characters to be used in creating strings. Let A = {a,b} be an alphabet. We define A* to be all strings of length 0 or more made up only of letters in the alphabet A. (The length of a string is the number of characters in it.) (a) Write a recursive definition for A*. (b) Write a recursive definition for A* -A, i.e. all strings of length 1 or more that can be made with the letters in A.

write a recursive version. The function takes two string parameters, s1 and s2 and returns the starting index of s2 inside the first string s1, or -1 if s2 is not found in s1. You must not use any loops; you also cannot use the string member functions find or rfind. You may use the member functions size, at and substr. Your function must be recursive.

2. Sum: a recursive function that computes the sum of integers 1, 2, 3, …., n for a given number n. So Sum(6) should return 1 + 2 + 3 + 4 + 5 + 6 , i.e. 21.sum(n) = n + sum(n-1)

Unique Answer

Python ques

here is my c++ problem I'm working on. I have to use recursion to find all possible anagrams of a word. for example  Please enter a string for an anagram: artMatching word artMatching word ratMatching word tarPlease enter a string for an anagram: regardlessNo matches found the txt file consists of words from A to Z about 28,000 words  need help finishing this problem. but  may not use any of C++'s iteration constructs (do, while, for, and goto) or any STLalgorithms   #include <iostream>#include <fstream>#include <istream>#include <cstring>using namespace std; const int MAXRESULTS = 20; // Max matches that can be foundconst int MAXDICTWORDS = 30000; // Max words that can be read in int loadWords(istream& dictfile, string dict[]);int recBlends(string word, const string dict[], int size, stringresults[]);void showResults(const string results[], int size);void printPermutations(string prefix, string rest); void loop(string prefix, string rest, int i, int max);…

Write the definition of a recursive function int simpleSqrt(int n) The function returns the integer square root of n, meaning the biggest integer whose square is less than or equal to n. You may assume that the function is always called with a nonnegative value for n. Use the following algorithm: If n is 0 then return 0. Otherwise, call the function recursively with n-1 as the argument to get a number t. Check whether or not t+1 squared is strictly greater than n. Based on that test, return the correct result. For example, a call to simpleSqrt(8) would recursively call simpleSqrt(7) and get back 2 as the answer. Then we would square (2+1) = 3 to get 9. Since 9 is bigger than 8, we know that 3 is too big, so return 2 in this case. On the other hand a call to simpleSqrt(9) would recursively call simpleSqrt(8) and get back 2 as the answer. Again we would square (2+1) = 3 to get back 9. So 3 is the correct return value in this case.

Write a function that takes in an integer n and computes n!. Do this without recursion.   In [ ]: deffactorial_iter(n):"""Takes in an integer n>0 and returns the product of all integers from 1 to n."""# YOUR CODE HEREraiseNotImplementedError()   In [ ]:     In [ ]: assert factorial_iter(6) == 720 assert factorial_iter(7) == 5040 assert factorial_iter(10) == 3628800

In C++ Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names (until -1), and use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia -1 hen the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia  #include <vector>#include <string>#include <iostream> using namespace std; // TODO: Write method to create and output all permutations of the list of names.void AllPermutations(const vector<string> &permList, const vector<string> &nameList) { } int main(int argc, char* argv[]) {   vector<string> nameList;   vector<string> permList;   string name;    // TODO: Read in a list of names; stop when -1 is read. Then call recursive method.      return 0;}

Please can be handwritten. Question 2: Implementing a Recursive Function . Write recursive function, recursionprob(n), which takes a positive number as its argument and returns the output as shown below. The solution should clearly write the steps as shown in an example in slide number 59 and slide number 60 in lecture slides. After writing the steps, trace the function for “recursiveprob(5)” as shown in an example slide number 61. Function Output: >> recursionprob(1) 1 >> recursionprob(2) 1 4 >> recursionprob(3) 1 4 9 >>recrusionprob(4) 1 4 9 16