Develop a method for solving the congruence AX2 Bx C 0 mod

Develop a method for solving the congruence AX² + Bx + C 0 (mod p) by use of indices, when p is an odd prime not dividing A. ( make the leading coefficient 1 and then, after suitable modification if necessary, complete the square). Apply your method to a) 15x² - 4x + 9 0 (mod 41) b) 15x² - 4x + 23 0 (mod 41).

need help please explain everything thank you