Two algorithms A, B sort the same problem. When you go through each algorithm and break them down into their primitive operations, each can be represented as below A = n 4 + 100 n 2 + 10 n + 50 B = 10...

1. Two algorithms A, B sort the same problem. When you go through each algorithm and break them down into their primitive operations, each can be represented as below

                             A =
n
⁴
+ 100n
²
+ 10n
+ 50

                              B = 10n
³
+ 2n
²
+ nlogn
+ 200

  For very large values of n which of these algorithms explain why B

  will run in the shortest time to solve the problem