Write and exaplain an algorithm to find the output if the value of base is given as input. Algorithm should be of O(1) space and O(1) time complexity.

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.

A sport footwear maker produces three different types of athletic shoes, namely: “Trainer”, “Runner” and “Sneaker”. Given K pairs of athletic shoes, where K is a positive integer, develop an algorithm to count and display the numbers of “Trainer”, “Runner”, and “Sneaker” pairs of athletic shoes respectively. The pairs of athletic shoes are processed one at time. The number K is provided as input to the algorithm. Specify the Algorithm using a flowchart. Hint: Processing a pair of athletic shoes involves reading/entering the type, i.e. “Trainer”, “Runner” or “Sneaker.” Note: To draw the flowchart you may use Visio, MS Words or any free flowchart solutions such as Lucidchart ( www.lucidchart.com ) or Raptor ( raptor.martincarlisle.com)   can you please make flowchart.

Let A be an array of n integers: (a) Write a pseudo code for a divide-and-conquer algorithm that computes the MAX and MIN values in array A . (b) Write the recurrence for this algorithm. (c) Solve the recurrence using the substitution method.