Integer programming assumes that all decision variables are integers. This is important if burgers are produced as it is not possible to produce and sell half a burger. a) (1 Point) Argue why a linear optimization approach will not necessarily result in a feasible solution in this context. b) (1 Point) Describe the so called travelling salesman problem and roughly describe a greedy algorithm to tackle it. c) (1 Point) Describe three situations in which the travelling salesman problem can be used. (They can but do have to apply to the Jakes Case Study.).