Consider the following Java code

public static String repeat$2($char c$,$ int n$)\{$

StringBuilder sb $=$ new StringBuilder$()$;

for $($int j$=0$; j $<$ n; j$++)$

sb$.$append$($c$)$;

return sb$.$toString$()$;

$\}$

As the input size doubles, the running time approximately grows by a factor of:

Question $19$ options:

log$(2)$

$2$

$1$

$4$