Strassen's matrix multiplication algorithm has a worst$-$case running$-$time of approximately $\backslash$Theta $($nb$)$ for which exponent b$?$

Group of answer choices

b $=3$

b $=$ log$2(7)$

b $=$ ln$(7)$

b $=$ log$10(7)$