Hi can I please get help with the below question(s) regarding the subject of computer science. I want to understand how to solve it myself.

Part B: Order of Growth and Big O Notation

1. Find the order of the following function and show it in Big-O notation:

a) f(n)= 200n²+n³+560n² logn =

b) f(n)= 200n²+n³+560n² logn

n²

c) f(n)= 200n²+n³+560n² logn

n

d) f(n)= 200n²+n3+560n² logn

n³