I have these two questions sloved but can you just look into to codes why singed and unsigned little looks diffrnet is that I can use one structure for both codes. for example can I use unassigned answer to the singed one ? this is not grading question this is prof gave for practice and I wrote my codes so do not reject all i need to know can I use unsiged answer to singed File Edit ViewProblem 17 (Unsigned integer radix sort - ): Write a C program for sorting 32-bit unsigned integersusing radix sort with a group of 4 bits. Use the variables listed below. Assume 1st is initialized with n numbers.#define N 1048576#define BIN 256#define MAXBIT 32#define LST 1#define BUF @int n, group, bin;int flag; /* to show which one holds numbers: 1st or buf */int 1st[N], buf[N];int count [BIN], map[BIN], tmap [BIN];int main(int argc, char **argv) {int i;flag = LST;initialize(); /* initialize 1st with n random floats */for (i = 0; i < MAXBIT; i = i + group)radix_sort(i); /* move 1st to buf or buf to 1st depending on the iteration number */correct(); /* sorted numbers must be in 1st */}void radix_sort(int idx) {int i, j, k, mask; /* initialize mask for lifting the 4 least significant bits. */int *src_p, *dst_p; /* cast 1st and buf to int pointers to treat 1st/buf as int's *//* set src_p and dst_p */}if (flag == LST) {src_p= 1st; /* Set src_p to 1st */dst_p = buf; /* Set dst_p to buf */} else {src_p buf; /* Set src_p to buf */dst_p=1st; /* Set dst_p to 1st */}flag(flag ==LST)? BUF: LST;mask = 0xF; /* 4 bits mask /=/* count */for (i = 0; i < BIN; i++) {count[i] = 0;}for (i = 0; i < N;i++) {count[(src_p[i] >> idx) & mask]++;}/* map /map[0] = 0;for (i = 1; i < BIN; i++) {}/* move */for (i = 0; i < N;i++) {dst_p[map[(src_p[i] >> idx) & mask]++] = src_p[i];}map[i] = map[i-1]+ count[i-1];}void correct() {int i;if (flag == LST) {for (i = 0; i < N;i++) {1st[i] = buf[i];}} else {for (i = 0; i < N; i++) {buf[i] 1st[i];=} Problem 16 (Signed integer radix sort): Write a C program for sorting 32-bit signed integers usingradix sort with a group of 8 bits. Use the variables listed below. Assume 1st is initialized with n numbers#define N 1048576#define BIN 256#define MAXBIT 32#define LST 1#define BUF @int n, group, bin;int flag; /* to show which one holds numbers: 1st or buf */int 1st[N], buf[N];int count [BIN], map[BIN], tmap [BIN];int main(int argc, char **argv) {int i;flag = LST;initialize(); /* initialize 1st with n random floats */for (i = 0; i < MAXBIT; i = i + group)radix_sort(i); /* move 1st to buf or buf to 1st depending on the iteration number */correct(); /* sorted numbers must be in 1st */}void radix_sort(int idx) {int i, j, k, mask; /* initialize mask for lifting the 4 least significant bits. */int src_p, dst_p; /* cast 1st and buf to int pointers to treat 1st/buf as int's *//* set src_p and dst_p */if (flag == LST) {src_p= 1st; /* Set src_p to 1st /dst_p= buf; /* Set dst_p to buf */} else {}src_p= buf; /* Set src_p to buf */dst_p= 1st; /* Set dst_p to 1st */}// Initialize mask for lifting the least significant bitsmask = (1 << group) - 1;/ count */// Initialize count arrayfor (i = 0; i < bin; i++) {count[i] = 0;}// Count the occurrences of each bin valuefor (i = 0; i> idx) & mask;count [j]++;}/* map /// Compute the starting position of each bin value in the map arraymap[0] = 0;for (i = 1; i < bin; i++) {}/* move */// Move elements from src_p to dst_p based on the computed positionsfor (i = 0; i< n; i++) {map[i] = map[i-1] + count[i-1];j= (src_p[i]>> idx) & mask;k = map[j]++;dst_p[k] = src_p[i];}void correct() {// Sorted numbers must be in 1stif (flag == BUF) {// Copy numbers from buf to 1stfor (int i _ a. i zn. iaal SLn 3, Col 160%Windows (CRLF)

In the C programming language, integers can be classified as either signed or unsigned. This is…

Answered: I have these two questions sloved but…

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE