Can I get some help on this question with answer and detailed explanation? I just have no idea how to approach and where to start...

Iterated Deletion of Strictly Dominated Actions Find a value of q for which the following game is strictly dominance solv- able. You can obtain one bonus point if you determine a range of values for which the game is dominance solvable. [HINT: start by determining for which value(s) of q a1 strictly dominates a3.] Paris 61 b2 b3 b4 a1 6,5 3q, 5q 2q, -1 2, 1 Rome a2 9 +1,4 1, 4 5,3 1,4 a 0,3 1, -1 2, 4 0, q CLA 0. 3 1,3 2,0 2, 0