Data algorithms and time complexity:

PLEASE FOR THIS QUESTION, ANSWER BY EXPLAINING THE TIME COMPLEXITY, AND GROWTH RATE AND SHOW IT WITH DRAWING GRAPHS. PLEASE I WANT EXPLANATION TO UNDERSTAND <3

This question consists of several parts. Each part lists the running times of several algorithms as a function of the input size n. Sort the running times for each group (separately) in terms of running time growth (algorithms with a running time that grows the slowest in terms of n should be first).

Part 1

o 5 n0.5

o 1000 n1.1 / n

o 0.01 n lg(n)

o n lg(n)

o n / 1.1

Part 2

o 3 n / lg(n)

o n

o lg(n)

o 2 n0.5

o lg2(n)

Part 3

o 2 n2 + 5 n + 3 n lg(n)

o 2.5 n2 - 1000 n lg(n)

o 1000 n lg(n) + 15 n

o n2.1/lg2(n) 5 n2

o 1.01n 5 n3

I will vote for the correct answer and write a good review for who answers correctly