6. [3 pts] Write the complement of the following function in product-of-maxterms form: F(A, B, C, D) = (A'BC + CD) (D+A)

4a) Write a recursive function to detect subsequences. For example: (subseg (u te p) (I uteplayer)) will return t (subseg (n m s u) (I uteplaye r)) will return nil (subsequencep '(a b) (a a b c)) will return t wwww.

dont use string library  its a C code

Question 1: You are given a set of symbols for the elements in the periodic table eg. [... Li, Be, B, C, N, F, Ne, Na, Co, Ni, Cu, Ga, Al, Si...] Write the function BreakingBad(name, symbols) that given a name and a set of symbols returns the phrase with the following format. For example: Symbols = [H, He, Li, Be, B, C, N, F, Ne, Na, Co, Ni, Cu, Ga, Al, Si, Fa] BreakingBad(“henry alba”, symbols) results in [He]nry [Al]ba

The following fragment code is an example of. x=mall(k,j); А. function call function definition C. first line of function definition B.

in c++

C Program: An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to the number.  For example, 6 is a perfect number because 6 = 1 + 2 + 3.  I have written a function called isPerfect (see below), that determines whether parameter passed to the function is a perfect number.  Use this function in a C program that determines and prints all the perfect numbers between 1 and 1000.  Print the factors of each perfect number to confirm that the number is indeed perfect.   // isPerfect returns true if value is perfect integer, // i.e., if value is equal to sum of its factors int isPerfect(int value) {    int factorSum = 1; // current sum of factors      // loop through possible factor values    for (int i = 2; i <= value / 2; ++i) {         // if i is factor       if (value % i == 0) {          factorSum += i; // add to sum       }       }       // return true if value is equal to sum of factors    if (factorSum == value) {       return…

F(?,?,?)=?′?′?+?′??+??′?′+??′?can you simplify this and draw the diagram of the simplified function

Describe the parameters of function pow.

In OCaml programming language: