Consider the following functions as time complexities of some algorithms. (a) First write the worst-case runtime of each algorithm in Big-O notation. (b) Then arrange functions from low to high (Consider their Big-O notations as you arrange them; as n grows, the function that grows slower should come sooner than the one that grows faster). (c) Arbitrary, select TWO of arrangements in part (b) and for each one of them justify why you have chosen such an ordering for the corresponding function. Provide formal proof. For example if fl<=f2<= f3<= f4<=f5 you may choose to formally justify why (1) fl<=f2 and why (2) f4<=f5. fl(n)=n°,

Given two sequences X and Y, we want to find Z i.e., the longest common subsequence (LCS) of both X and Y. Because we know that subsequences of interest are of length >= a and <= b, we threshold the LCS definition to |Z| in [a, b] (where |Z| is the sequence length). In python state the recursive formula for this problem. Implement the algorithm with bottom-up approach dynamic programming and backtracking. Create an iterative function that prints the longest common subsequence(LCS).

4. Give an analysis of the running time (Big-Oh will do).   sum = 0;   for( i = 0; i < n; ++i )   for( j = 0; j < n * n; ++j )   ++sum;

PLEASE explain how to solve this STEP BY STEP

Find the running time for each of the following algorithms. Show work by finding a table of values for each while loop, writing the summations, then solving. Be sure to show work on both the upper bound and lower bound, justify the split, and check that the bounds differ by only a constant factor. Use asymptotic notation to write the answer. b) Func3(n) 1 2 3 4 5 6 7 8 9 10 11 S← 0; i+n; while (i 8) do s+ s + i - j; j← lj/⁹]; end i + 4 x i; end return (s);

Give the asymptotic complexity of each of the following functions in simplest terms and then order the functions by asymptotic dominance. That is, produce a permutation, f₁(n), f₂(n), such that fi(n) = O(fi+1(n)). Note if any two functions are asymptotically equivalent, i.e., if fi (n) = O(fi+1(n)). Note: 'Ig x' is a simpler notation for 'log₂ x'. fe(n)= 4 lg (n²+ 2n) + 6nº.7 f(n) = n5 + 10¹0 lg (n+100) fe(n)= 3n lg (n² + 2) + n²

Help with this please

I need help with this please