Trading strategies consider the following generalization of the jukebox problem you solved manually on the previous homework assignment: each month you can buy up to maxbuy jukeboxes at buy (bid) price, sell up to maxsel1 jukeboxes at the selling (ask) price, or do nothing. for each jukebox in inventory at the end of a month, you must pay s100 for maintenance and cleaning. for each jukebox left over at the end of the time horizon, you obtain a "salvage value" of s2000. suppose initially that you have exactly the same situation described in the last homework: your inventory capacity is 2 jukeboxes, maxbuy 1, maxsell-1 and you start with 0 inventory. you are planning for 4 months and the selling and buying prices you expect for the next 4 months are as follows: month1234 sell (ask) price$2500$2800$2000$2700 buy (bid) price$2600$2900$2100$2800 required : create a python program to maximize your profits in the following instance of the problem, identical to the one you solved by hand on the previous homework assignment. print out and hand in both the source code for your program and its output. in addition, upload your source code to blackboard, under "assignments" and "homework assignment 6, q2(a)". you are encouraged to use the python codes and templates distributed in class as a starting point for your code.