A bank has opened two branches for check transactions. Branch 1 can process 1000 checks per day, and branch 2 can process 600 checks per day. This bank provides corporate, commercial, and personal check services. For these transactions, branch 1 incurs costs of 10, 8, and 4 TL, respectively. For branch 2, the corresponding numbers are 6, 8, and 10 TL. Each day, 500 transactions must be made for each type of check (500 corporate, 500 commercial, and 500 personal check customers come to the branches and their requests must be met). Write a Linear Programming (LP) problem to minimize the daily cost of these two branches.

Can u solve this question with python or R ?