We have seen that the Dynamic Programming algorithm for the Traveling Salesman Problem has a time complexity of T(n) = (n - 1)(n – 2)2n-3 . Suppose that on our present computer we can run an instance of n = 5 in 4 sec. How long does it take for the computer to perform one basic operation?

The answer & explanation for this question is given in the attachment below.

Idk i just need points lol

Reddit is  an american  social news  sharing service, web content  rating, and  discussion  website.  the name "reddit" is a  play-on-words  with the phrase "read it",  when items (links or text posts) are submitted to a subreddit, the users, called "redditors",  can vote for or against these links or posts (upvote/downvote).