Consider a linear programming problem having $m$ equality constraints and $n$ variables and assume that

none of the constraints is redundant. What are the number of additions and multiplications that a step of

the revised simplex algorithm executes $($i$.$e$.,$ the cost of an iteration of the revised simplex algorithm$)?$