$1.$ Compute the size of the problem that can be solved on a machine that takes $10-9$ sec$/$op in one day when T$($n$)15$n$2,8$n$",2",3,$ n$!,$ nlogn$.$ Also plot T$($n$)$ vs n where n e $[2,20)$ on a graph. $(10$ pt$)$ Note: You can use any programming language to generate the graphs.