Compute the size of the problem that can be solved on a machine that takes $109$sec$/$op in one day

when T$($n$)=15$n$2,8$n$3,2$n$,3$n$,$ n$!,$ nlogn$.$ Also plot T$($n$)$ vs n where n in $[2,20]$ on a graph. $(10$ pt$)$

Note: You can use any programming language to generate the graphs.