an algorithm in Artificial Intelligence

Please solve the answers and attach any sources that helped you answer them, showing all the details WITH EXPLANATION SO I UNDERSTAND.

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

Each part list 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 running time that grows the slowest in terms of n should be first). - Part I 5n0.5 1000n1.1 0.01nlg(n) nlg(n) c n/1.1 - Part ii 3n/lg(n) 2n0.5 lg2(n) - Part iii 2n2+5n+3nlg(n) 2.5n21000nlg(n) 1000nlg(n)+15n n2.1/g2(n)5n2 1.01n5n3