Using the Big$-$O runtime complexity, how many times longer will sorting a list of $15$ elements take

compared to sorting a list of $5$ elements?

$9$

$3$

$1/3$

$1/9$