Solve a Linear Programming Problem using the Graphical Method (CLO1)

A company produces popsicles, strawberry and cola flavor are processed using two different machines. Machine A can only be operated for 5 hours a day, while machine B can only be operated for 9 hours a day. The strawberry popsicles require one hour in machine A and three hours in machine B, while the cola popsicles require two hours in machine A and two hours in machine B. Profits from the strawberry popsicles and cola popsicles are RM5 and RM9, respectively.

Use the graphical method to determine the maximum number of these products that needs to be produced daily for maximum profit

(NOTE: the point of intersection must be shown correctly on a scaled graph paper and verified using solutions from simultaneous equations).

need to know how to scale the graph