Given the code snippet below which returns a list of all the permutations of a string "inp" with length x. Find the following: - The recurrence relation of the running time of func(inp)? (Assume that appending to a list and string concatenation both run in constant time or O(1). Hint: Determine the number of returned elements first) - The worst case time complexity of func(inp). (Be as precise as possible with factorials. In other words, between any factorials such as n! (n+1)! and (n-1)!, only the most precise answer will be acepted)

Complete the functional program given below to return the longest palindromic substring of the string passed as a parameter. class Solution { public: string longestpalindrome(string s) { //write your code here } //write code here for any extra functions needed }; Allowed Time Complexity: O(n^2) Use constant space. Language: C++

Remains code.  Implement regular expression matching with support for '.' and '*'. '.' Matches any single character.'*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype should be:bool is_match(const char *s, const char *p) Some examples:is_match("aa","a") → falseis_match("aa","aa") → trueis_match("aaa","aa") → falseis_match("aa", "a*") → trueis_match("aa", ".*") → trueis_match("ab", ".*") → trueis_match("aab", "c*a*b") → true""" def is_match(str_a, str_b):    """Finds if `str_a` matches `str_b`     Keyword arguments:    str_a -- string    str_b -- string    """    len_a, len_b = len(str_a) + 1, len(str_b) + 1    matches = [[False] * len_b  for _ in range(len_a)]     # Match empty string with empty pattern    matches[0][0] = True     # Match empty string with .*    for i, element in enumerate(str_b[1:], 2):        matches[0][i] = matches[0][i - 2] and element == '*'     for i, char_a in…

‘Write a function nesting(), which takes an arbitrary number of parameters, and returns a list containing the arguments. Write another function unnesting(), which takes a list L as the parameter and retums a 1D list. Notice that, you should be able to use loops to solve thisproblem and should not use recursive functions (which we will not cover in this course). ‘Write assertions to test the two functions.For example nesting(1, nesting(2, 3, nesting(4, 5, [6])), [7, 8], 9)unnesting([1, [2, 3, [4, 5, [6]]], [7. 8], 9])   (1, [2, 3, [4, 5, [6]]], [7, 8], 9][1, 2,3, 4, 5, 6, 7, 8 9]

Can someone help me with this question in C++ and not any other programming language No library functions that leverage hash and maps can be used except to make it all lowercase  List sentence(s) with the maximum no. of occurrences of the word "the" in the entire file and also list the corresponding frequency. List sentence(s) with the maximum no. of occurrences of the word "of" in the entire file and also list the corresponding frequency. List sentence(s) with the maximum no. of occurrences of the word "was" in the entire file and also list the corresponding frequency. here is a link too the file its called tiny1 https://drive.google.com/file/d/1ariNN_rW9c3vijK1hvjObcQJafYQ2gzm/view?usp=sharing

In Kotlin, Write a recursive function called myZip, with an expression body. MyZip takes two Lists and returns a List of Pairs in which each value may be any type (I suggest your start by thinking out how to represent this data type). The pairs consist of corresponding elements in the two lists (the first element of the first list and the first element of the second list, etc). The base case should be that either (or both) of the original lists has length 1, so that, if the lists have different length, the zipping stops when the first list runs out of values.

Q3. Let E = {a, b}. Let BDFA = {(M)| M is a DFA that accepts some string containing an equal number of as and bs). Show that BDFA is decidable. (Hint: remember the different results/theorems about CFLs, provide a semi-formal discussion/argument)

Complete the follow Kotlin program by defining “positives” and “negatives” values for a collection of numbers using the filter higher ordered function.The Filter takes lambda expression as their input. For the “negatives” value, use the it shorter notation. fun main() {val numbers = listOf(1, -2, 3, -4, 5, -6)   println("Numbers: $numbers") println("Positive Numbers: $positives") println("Negative Numbers: $negatives") }

Write a function filter_codes(list_codes) that receives a list of codes and returns another list containing those codes that:    Only have numeric characters; and Are at least 2 characters long; and At most 6 characters long Hint: remember that Python has a built-in function for determining if a string only contains numeric characters. solve using python

I need correct answer unique answer for this. Don't copy from anywhere otherwise I'll report your account for sure. Last time I received wrong answer for this. This time i need right answer. Do not send wrong and plagiarism response