Figure 4.11 implements a function to perform big integer division. Extend this function to return the remainder as well.

1 signed int bigint_udiv (signed int *a, signed int *b) { signed int *q, *t, *c, x=NULL, *y=NULL; 2 q (signed int *)malloc(2* sizeof (signed int)); q[0] = 1; c (signed int *)malloc (2* sizeof (signed int)); c[0] = 1; c[1] = 1; 3 4 5 6 q[1] = 0; 7 8 9 10 11 12 13 14 15 16 17 18 19 20 N NN 21 22 23 24 25 t = bigint copy (a); while (1) ( if (x = NULL) free (x); if (y NULL) free (y); x = bigint_usub (t,b); y = bigint_uadd (q, c); free(t); free (q); t = bigint_copy (x); q=bigint copy (y); if (bigint_ucompare (t,b) < 1) break; 26 } 27 28 free (x); 29 free (y); 30 free (t); 31 free (c); 32 return q; 33) Fig. 4.11 Low-level big integer division