Prompt the user for an input strings, until they decide to quit, and use the DFA from Step 2 to determine whether the user’s string is accepted by the DFA or not. Output this result. Recall, an input string is accepted, if beginning in the initial DFA state, the input transitions to a final state in the DFA, and no additional input is left.

Write a program that begins by reading in a series of positive integers on a single line of input and then computes and prints the product of those integers. integers are accepted and multiplied until the user enters an integer less than 1. this final number is not part of the product. then, the program prints the product. if the first entered number is negative or 0, the program must print “bad input.” and terminate immediately. next, the program determines and prints the prime factorization of the product, listing the factors in increasing order. if a prime number is not a factor of the product, then it must not appear in the factorization. sample runs are given below. note that if the power of a prime is 1, then that 1 must appear in t

Im doing this last minute and literally none of my neighbors or people that my dad works with use excel so if anyone could me make up an example

Least square fit to polynomial write a function leastsquarefit3pol that solves a linear system of equations to find a least squares fit of a third order polynomial to an experimental data set given as two row arrays. the function leastsquarefit3pol must explicitly solve a set of linear equations and cannot use polyfit. there should be no restriction on the size of the problem that can be solved.