Brissett Corporation makes three products that use the current constraint, which is a particular type of machine. Data concerning those products appear below:

Required:

a$.$ Rank the products in order of their current profitability from the most profitable to the least profitable. In other words, rank the products in the order in which they should be emphasized.

b$.$ Assume that sufficient constraint time is available to satisfy demand for all but the least profitable product. Up to how much should the company be willing to pay to acquire more of the constrained resource? $($Round your answer to $2$ decimal places.$)$

$\backslash$table$[[$Ranking$,],[$a$.$ GK$,],[$a$.$ LQ$,],[$a$.$ XK$,],[$b$.$ Maximum amount,$]$