Suppose we analyze algorithm A to determine its time complexity and we determine that f(n) = 137.5n3 + 2125.25n2 + 15033n + 31595. If we let g(n) = n³ and C be 138 then what would the minimum integer...

I’ve asked this question twice on Bartleby, and twice I’ve received screenshots of the same (incorrect) answer on Chegg. If someone could explain the actual answer to this question, I would appreciate it.

Extracted text: Suppose we analyze algorithm A to determine its time complexity and we determine that f(n) = 137.5n3 + 2125.25n2 + 15033n + 31595. If we let g(n) = n³ and C be 138 then what would the minimum integer value of the constant no have to be in order to prove that the time complexity of A is O(n)? Enter your solution as an integer with no leading zeros or commas. For example, if your solution is 1,192 then enter 1192.