Suppose you are given a set, S$,$ containing numbers $1$ to $n.$ In other words, $,$

$n.$ What is the runtime of the brute$-$force algorithm to print all the subsets of $S.$

$2^n$

$n$

$nlogn$

$n^2$