Solve this Chinese double modular algorithm:

7 Pre: p and qare both different prime numbers. // Returns: A unique integer c such that c is congruent to n modulo p c is congruent to d modulo q public int int c 6; return c: cra(int p. int q. int n, int d)
PayPal Gateway not configured
PayPal Gateway not configured