For function f $($n$)=$ n lg n determine the largest size n of a problem that can be solved in $1$ year $(365$ days $),$ assuming that the algorithm to solve the problem takes f $($n$)$ microseconds. $($lg is base $2.)$