The coding is in Python3 but requires to output a html tabel similar to table image provided.

Write a Python program to solve problem 1.1, Comparison of running times, of your textbook (aka CLRS book). You may assume that there are 30 days/month and 365 days /year. In solving the problem, you may consider using 'scipy, 'numpy', 'math', or any other modules available to help solve your problem. Your output should be in an HTML text format which includes a table with your answers as shown in the textbook. You may also use any HTML library module or use simple print() or write() functions to write your own html file. Either way, you will learn how to write an html file. However, when the HTML file is loaded on a browser, it should display a table in a reasonably nice table format looking like the one in the textbook. Demonstrating basic understanding of algorithms efficiency Learning and exercising Python with math and/or numpy modules Basic HTML syntax of

tag Deliverable: Program source code in .py or .ipynb format Output in HTML file format f(n) log n 1 Mo = 2.592. 1012ms 1 Cnt = 3.1104 . 1015 ms 107.776-1011 109.3312-1011 6.718464 . 1024 9.67458816. 1030 1012 1 Sec = 106ms 1 Hr = 3.6. 10ms 1 0300000 101080000000 12.96 1018 106 62746 1.333780589. 108 6.0. 10" 102 1.533. 109 31 n log n 103 7.187085640. 1010 1.6100. 106 1.374 . 10^ 6.769949846. 1013 5.5771 . 107 1.460 - 10 19 41 51 15 17 Problems 1-1 Comparison of running times For each function f(n) and time t in the following table, determine the largest size n of a problem that can be solved in time 1, assuming that the algorithm to solve the problem takes f(n) microseconds. Notes for Chapter 1 second minute hour day month year century Ign