The corner points of the feasible region of a linear programming problem are (0,4),(8,0) and (‌

20

3

,‌

4

3

). If Z=30x+24y is the objective function, then (maximum value of Z - minimum value of Z ) is equal to