If the computing time of an algorithm is O$(2^$n$),$ it should perform acceptably for most large inputs. $($True or false$)$

Group of answer choices

True

False