You are building a system consisting of n components. There are two possiblesuppliers for each component: Alpha and Omega. Alpha charges αi for component i, andOmega charges ωi. You'd like to spend as little money as possible, but also want to takethe costs due to incompatibilities between components of different suppliers into account. Inparticular, if you buy components i and j from different suppliers, there is an incompatibilitycost of c(i, j).Design an efficient algorithm to determine from which supplier you should buy the components so as to minimize the sum of the purchase costs and the incompatibility costs.
I believe the algorithm will use dynamic programming.