You have a server and n computational jobs that you need to run on this server. Jobs 1,2,,n require T hours of server time to complete. Moreover, each job requires unique server settings, and t_i,jis the time required to reconfigure the server to start the job j after the job i is finished. You need to find a job execution sequence such that its total duration is minimal.

Represent this problem as an algorithmic problem. What is this algorithmic problem? Is it possible to solve it in a polynomial time? What algorithm would you use to find a solution? Explain you answers.