2. Define asymptotic analysis of an algorithm. 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 t,
assuming that the algorithm to solve the problem takes f(n) microseconds.
1 Sec
1 Min
1 Hour
1 Day
7 Days
15 Days
1 Month
logn?
va
2n
2"
From your calculation, can you draw some conclusions? Explain here.

You are almost finished updating a web site. as part of the update, you have converted all pages from html 4.0 to html5. the project is currently on schedule. however, your project manager has been asked by the marketing team manager to justify a day of time spent validating the site's html5 pages. the marketing team manager does not have technical knowledge of the internet or the web. which is the most appropriate explanation to provide to the marketing team manager?

What can tanya do now to start preparing for the college and scholarship application process? think about her grades, activities in which she can get involved, possible part-time jobs at which she can work, and standardized tests she can take. (10 points) apex

Pp 4.1 design and implement a class called sphere that contains instance data that represents the sphere’s diameter. define the sphere constructor to accept and initialize the diameter and include getter and setter methods for the diameter. include methods that calculate and return the volume and surface area of the sphere (see pp 3.5 for the formulas). include a tostring method that returns a one-line description of the sphere. create a driver class called multisphere, whose main method instantiates and updates several sphere objects.