$5.$What is the main advantage of Karmarkar's algorithm over traditional simplex methods for linear programming?

a$)$ It is faster in practice

b$)$ It is easier to implement

c$)$ It always finds the global optimum

d$)$ It requires less memory