s.push(3) s.push(4) print s.pop() s.push(5) print s.pop() print s.pop() print s.pop() produce the sequence 2 4 5 3 1. Based on the constraints mentioned above, give the list of operations that would produce each of the following sequences. If it is not possible, state so. a. 1 3 5 4 2 b. 23451 C. 143 52 d. 1 5 4 2 3 e. Are there sequences that cannot occur? Explain why or why not.

C++

Write a fraction calculator program that adds, subtracts, multiplies, and di-vides fractions. Your program should check for the division by 0, have and use the following functions:(a) subtract - finds the reduced difference of a pair of given fractions, by makingthe second fraction negative then using the add function.(b) multiply - finds the reduced product of a pair of given fractions.(c) divide - finds the reduced quotient of a pair of given fractions by inverting the second fraction then using the multiply function

Problem 7 [Algorithms integers m and k such that n = m × 24, where m is the smallest integer. For any even integer n, it is always possible to find a pair of 1. Write an algorithm that finds a factorization of any even integer n as stated above. For instance, we have the following two factorizations: 48 = 3 × 24 instead of 48 = 12 × 22 52 = 13 x 22 instead of 52 = 26 × 2. 2. Analyze the time of your algorithm by computing the number of its multiplications. Show your work step by step. Otherwise, your solution is incorrect.

Write a C program that does the following tasks using while loop: • Reads 7 integers. • Finds the sum of numbers that are divisible only by 5.