Get Solutions for: Suppose the operation count of an algorithm can be expressed interms of the number of entries in a l

Suppose the operation count of an algorithm can be expressed interms of the number of entries in a list nby the formula 5n2+35n2log2n + 170n +5. What is the Big-O for thisalgorithm?a.O(5n2)
b.O(n2)
c.O(35n2log2n)
d.O(n2log2n)
e.O(log2n)
f.O(170n)
g.O(n)h.O(170)
Attached