Assumptions... Alphabet Σ ● ● = {a,b} f(w) = wh o where we Σ+ To do in this exercise ... • Construct a Standard Turing Machine to compute the function f as described above. • Save your Standard Turing Machine as a JFLAP .jff file, and submit that .jff) file to Canvas as your solution to this exercise.

1. void Foo(int A[]) { 2. let c = A.size(); 3. for (i = 1 to c^2) { 4. Boo(i); 5. 6. j = c; 7. while (j> 1) { 8. } //end for print "hello"; 9. j=j/y; 10. }//end while 11.} If we are given that is a function whose asymptotic runtime is cubic in the input i.e. . What is the asymptotic run time of Воо Boo(n) = O(n³) Foo

Exercise 2: In probability theory, one problem that often arises is determining the number of ways in which p objects can be selected from n distinct objects without regard to the order in which they are selected. Such selections are called combinations. The number of combinations ofp objects from a set with n objects is C (n, p) and is given by: n! C(n, p) = (п - р)! * р! Write a Python program which will calculate and display on the screen the number of possible combination C based on the values of n and p; where both n and p are positive integers less than 21 and n> p. Implement and use at least the following three functions: fact(..): A function when passed a positive integer value, will calculate and return the factorial of that number. comb(.): A function when passed n and p (n: total number of objects and p: number of objects taken at a time) will calculate and return the total number of possible combinations (using the formula above). It calls function fact(.) main(..): reads…

Need python help. For problems 1 and 2, add your code to the file Lab2.java. Add your tests in the main function of Lab2.java. Do not use static variables in class Lab2 to implement recursive methods.  Problem 1: Implement a recursive method min that accepts an array and returns the minimum element in the array. The recursive step should divide the array into two halves and find the minimum in each half. The program should run in O(n) time and consume O(logn) memory. Demonstrate the output of min on the array int [] a = { 2, 3, 5, 7, 11, 13, 17, 19, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 23, 29, 31, 37, 41, 43 } Problem 2 You have been offered a job that pays as follows: On the first day, you are paid 1 cent, on the second day, 2 cents, on the third day, 4 cents and so on. In other words, your pay doubles every day. Write a recursive method computePay that for a given day number computes the pay in cents. Assume that you accumulate all the money that you are paid. Write a…