$7.$ Imagine a Disaster sorting algorithm whose time complexity was exponential $($D$($x$)=$ k$1$e$($k$2$x$)).$ Use limits to explain why this algorithm is worse than all four of the original algorithms. $8.$ If a new sorting algorithm is proposed in the future, describe how the company will be able to decide if the new algorithm is more time$-$efficient than your selection in part #$5$