Write a Python code that returns the reverse complement of a given DNA sequence

A linear program is given as follows:   Minimize x1+x2+x3 subject to 2x1 – 6x2 + 3x3 ≥ 50 3x1 + 4x2 -x3 ≥ 40 4x1 – x2 + 5x3 ≥ 60 x1, x2 ≥ 0   Solve the problem using a linear programming solver (e.g., linprog in python). What is the optimum solution? What are the values of x1, x2 and x3 for this optimum solution?   Instructions: Submit the following The new form of the problem (if you have changed the form) for linear programming solver input Code to solve the problem Answers of questions ‘a’ and ‘b’

A problem that can be solved in polynomial time by some non-deterministic algorithms 1S in class. (P, NP)

PROGRAM THIS CODE UING MATLAB

You solve a non-singular system of 1,000 linear equations with 1,000 unknowns. Your code uses the Gauss-Jordan algorithm with partial pivoting using double precision numbers and arithmetics. Why would the 2-norm of the residual of your solution not be zero?

In your own words, please list at least five problems in solving numerical problems using a direct method.