Can you explain how to solve part D

Q2: Given that 2 algorithms have the following time and space complexities: [30 marks] A1 time =3n3/2+4n200 A2 time =10nlognn+400n A 1 space =4n+12 A2 space =3n2+5 a. Give the Big-Oh notation of each algorithm A1(t)=O(n3/2),A1(s)=O(n)A2(t)=O(nlogn),A2(s)=O(n2)[12] b. Which one is better in terms of time complexity? A2 [2] c. Which one is better in terms of space complexity? A1 [1] d. For what integer value(s) of n will the worst algorithm in space complexity perform better than the best algorithm? [15] A1 space =4n+12 A2 space =3n2+5 When 3n2+524 so n