What is the time complexity of the fastest known matrix multiplication algorithm?

Group of answer choices

O$($n power to $3)$

O$($n power log$7)$

O$($n$!)$

O$($n power to $2\mathrm{.}37)$