In the best case, the recursion depth of Strassen's algorithm

is

$(\sqrt[\phantom{2}]{n})$

$(n^{lo{g}_{2}7})$

$(n^{lo{g}_{7}2})$

$(1)$

$(lo{g}_2(n))$