Ihave an algorithm that runs in o(n ), where n is the size of the problem. for n = 100, the time for the algorithm to run is 1 minute. how long does the algorithm take for n=1000? a) same time b) 10 minutes c) 100 minutes d) 1000 minutes

An electron is trapped at a defect in a crystal. the defect may be modeled as a one-dimensional, rigid-walled box of width 1.00 nm. (a) sketch the wavefunctions and probability densities for the n 1 and n 2 states. (b) for the n 1 state, nd the probability of nding the electron between x1 0.15 nm and x2 0.35 nm, where x 0 is the left side of the box. (c) repeat (b) for the n 2 state. (d) calculate the energies in electron volts of the n 1 and n 2 states