Consider two algorithms A and B that solve the same class of problems. The time complexity of A is 5000n. The time complexity for B is ceiling(1.1") or 1.1"] Find the time required to execute each for n=10, n=100, n= 1000, n=1000000 Tabulate your results? which algorithm has better performance for n>1000 Exercise 2: Find an upper bound and a lower bound for each of the function f(x). 1) f(x)=x²+2x+1.

python 3 Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names, then use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia then the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia question: is it any way that i can use ('if' statement as base case, and 'else' statement as recursive case) in the code below? thanks. code: def all_permutations(permList, nameList):# TODO: Implement method to create and output all permutations of the list of names.def createPermutationsList(nameList):f = len(nameList) if f == 0:return [] if f == 1:return [nameList] permList = [] for i in range(f):newList = nameList[i]remaining = nameList[:i] + nameList[i+1:]for p in createPermutationsList(remaining):permList.append([newList] + p)…

create a new Java application called "Parser"

Question 5 Dk  .Full explain this question and text typing work only     We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line