Provide a numerical value. the objective of this exercise is to find the largest input size n that an algorithm a with time complexity f(n) can handle in one year. we assume that f(n) is expressed in milliseconds. if f(n) = e", then algorithm a can handle in a year a problem of size n up to __

1in2 processor chip can be modelled as an isothermal plane wall of silicon, isothermal on both sides. the power input to the bottom of the plane wall, or the processing power of the chip, often called the thermal design power (tdp), is 100w. assume the periphery is adiabatic. the silicon is 400 microns thick. the temperature at the junction, or in this case on the bottom of the isothermal plane wall, is 85°c. what is the top surface temperature, assuming that the only mode of heat transfer is conduction