c++ Write a recursive function that, given two strings, returns whether the first string is a subsequence of the second. For example, given hac and cathartic, you should return true, but given bat and table, you should return false

Write the complete C-function void smallest(int data[], int size, int *small); finds the smallest value in d[] and return it via reference parameter. Show a call to this function in a calling function.

Write a c++ code. Write a recursive function, vowelsCount that returns the number of vowels in a string. Output must needed.

C++

C++

Asap

Do asap please.

In C program Write a recursive function count_digits()that counts all the digits in a string.This would be similar to function count()we covered during our last lecture,which counts the number of occurrences of a character chin a string str. Hint: Use function isdigit(str[0])to find out if str[0]is numeric.

‘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]

PHP Write a wordFilter function Write a function wordFilter($str) that takes a string representing a sentence as a parameter. It should replace all occurrences of certain blacklisted words with asterisks of the same length and return the substituted sentence. The words "shoot" "darn" and "fudge" (case insensitive) are considered blacklisted. However, these words as part of a larger word should be left alone (e.g. overshoot is fine as it is). Use one or more regular expressions with replacements in your solutions (e.g. preg_replace).

Write a lisp program (please provide photos that it works)

Please use python language. Write a recursive program to find the sum of first n numbers. sum = 1 +2 + 3 + .......n