Please only do question 4 and 8, Explain the steps and please clear hand writing or type it for clearer answer

Problem Specification This assignment contains 10 questions of order of complexity proofs and algorithm time complexity analysis. Provide your answers in a PDF file and submit it to the Assignment 2 dropbox in elearning. Questions: 1. Show that 149n3+1 is O(n3). 2. Show that 10n236n+91 is O(n2). 3. Show that 41n267n+48 is O(n3). 4. Show that 365n2 is not O(n). 5. Show that 85n3+96n+21=(n2). 6. Show that 37n430n+19=(n3). 7. Show that 129n3/(logn+83)=O(n3). 8. Show that 19n3+46n+60=O(n4). 9. Show that 76n3+34n4+419n22n=O(460n22n). 10. Show that 56n3+27n2=(n3)