Compute the size of the problem that can be solved on a machine that takes $10-9$sec$/$op in day when T$($n$)15$n$2,8$n$3,2",3",$ n$!,$ nlogn$.$ Also plot T$($n$)$ vs n where n e $(0,2048$ or one single graph