Write a program to convert a person's inputted text into uppercase, and then convert some of the letters into leet. Here is the key (case sensitive): A - 4 B -8 E-31-10-05
-5T-7 Z-2 For example, if the input is: "the quick brown fox jumps over the lazy dog"
the output will be: "7H3 QU1CK BROWN FOX JUMP5 OV3R 7H3 L42Y DOG"

The initial tableau of a linear programming problem is given. use the simplex method to solve it. x 1 x 2 x 3 s 1 s 2 z 1 2 4 1 0 0 8 3 4 1 0 1 0 10 minus3 minus12 1 0 0 1 0 the maximum is nothing when x 1equals nothing, x 2equals nothing, x 3equals nothing, s 1equals3, and s 2equals0. (be sure to simplify to lowest terms if necessary.)