An algorithm A$,$ takes a list S of distinct elements and produces its output in T$($n$)=3$n$2$ time. If the input size is doubled, by what factor will the time$-$to$-$output time increase. Show all working. $[2$ marks$]$