Please I need help with question one. I am working on chip-firing games.

1. Let G be the house graph: 05 04 U3 U1 U2 Let q = v1. Use Dhar's burning algorithm to find linearly equivalent q-reduced divisors for the following divisors on G (note that if a divisor is effective, it's not necessarily q-reduced, in other words you need to keep applying the algorithm until the entire graph burns): (a) D - 3v1 + 202 + 4V3 204 V5 (b) D2 = 2v1 + V2 503 + 204 + 205. (C) D3 = 202 203. 1. Let G be the house graph: 05 04 U3 U1 U2 Let q = v1. Use Dhar's burning algorithm to find linearly equivalent q-reduced divisors for the following divisors on G (note that if a divisor is effective, it's not necessarily q-reduced, in other words you need to keep applying the algorithm until the entire graph burns): (a) D - 3v1 + 202 + 4V3 204 V5 (b) D2 = 2v1 + V2 503 + 204 + 205. (C) D3 = 202 203