code $1$:#include

#include

void sortStudents$($char studentNames$[20][50],$ int n$)\{$

int i$,$ j;

for $($i $=0$; i $<$ n $-1$; i$++)\{$

for $($j $=$ i $+1$; j $<$ n; j$++)\{$

if $($strcmp$($studentNames$[$i$],$ studentNames$[$j$])>0)\{$

char temp$[50]$;

strcpy$($temp$,$ studentNames$[$i$])$;

strcpy$($studentNames$[$i$],$ studentNames$[$j$])$;

strcpy$($studentNames$[$j$],$ temp$)$;

$\}$

$\}$

$\}$

$\}$

int main$()\{$

int n;

printf$("$Enter the number of students: $")$;

scanf$("\%$d$",$ &n$)$;

char studentNames$[20][50]$;

for $($int i $=0$; i $<$ n; i$++)\{$

printf$("$Enter name of student $\%$d: $",$ i $+1)$;

scanf$("\%$s$",$ studentNames$[$i$])$;

$\}$

sortStudents$($studentNames$,$ n$)$;

printf$("$

Sorted List of Students:

$")$;

for $($int i $=0$; i $<$ n; i$++)\{$

printf$("\%$s

$",$ studentNames$[$i$])$;

$\}$

return $0$;

$\}$ code $2$:#define MAX$\_$STUDENTS $500$

#include

#define ID$\_$LENGTH $6$

typedef struct $\{$

char id$[$ID$\_$LENGTH $+1]$; $//+1$ for null terminator

$\}$ StudentRecord;

$//$ Function to find the memory location based on ID

int findMemoryLocation$($StudentRecord records$[],$ int numRecords, const char $*$targetID$)\{$

for $($int i $=0$; i $<$ numRecords; $++$i$)\{$

if $($strcmp$($records$[$i$].$id$,$ targetID$)==0)\{$

return i;

$\}$

$\}$

return $-1$; $//$ Return $-1$ if ID is not found

$\}$

int main$()\{$

StudentRecord studentRecords$[$MAX$\_$STUDENTS$]$;

$//$ Initialize some dummy student records $($for demonstration purposes$)$

for $($int i $=0$; i $<$ MAX$\_$STUDENTS; $++$i$)\{$

sprintf$($studentRecords$[$i$].$id$,"\%06$d$",$ i $+1)$;

$//$ Initialize other student information as needed

$\}$

$//$ Input ID from the user

char inputID$[$ID$\_$LENGTH $+1]$;

printf$("$Enter the $6-$digit ID number: $")$;

scanf$("\%$s$",$ inputID$)$;

$//$ Find the memory location based on the entered ID

int memoryLocation $=$ findMemoryLocation$($studentRecords$,$ MAX$\_$STUDENTS, inputID$)$;

$//$ Display the result

if $($memoryLocation $!=-1)\{$

printf$("$Memory location for ID $\%$s: $\%$p

$",$ inputID, $($void $*)$&studentRecords$[$memoryLocation$])$;

$\}$ else $\{$

printf$("$ID $\%$s not found in the records.

$",$ inputID$)$;

$\}$

return $0$;

$\}$ code $3$:#include

#include

int nand$($int input$1,$ int input$2)\{$

if $($input$1==1$ && input$2==1)\{$

return $0$;

$\}$ else $\{$

return $1$;

$\}$

$\}$

int not$($int input$)\{$

if $($input $==1)\{$

return $0$;

$\}$ else $\{$

return $1$;

$\}$

$\}$

int main$()\{$

int cp$,$ d$,$ op$3,$ op$4,$ q$,$ q$1,$ prev$\_$q$,$ prev$\_$q$1$;

$//$ cp is clock pulse

$//$ op$3$ is the output of gate $3$

$//$ op$4$ is the output of gate $4$

$//$ prev$\_$q is the previous output q of stage$2$

$//$ q is the output of stage$2$

$//$ Use system$("$clear$")$ for Unix$-$based systems or system$("$cls$")$ for Windows

system$("$clear$")$;

printf$("$Enter the value of CP $(0/1)$: $")$;

scanf$("\%$d$",$ &cp$)$;

printf$("$Enter the value of D $(0/1)$: $")$;

scanf$("\%$d$",$ &d$)$;

if $($cp $==0)\{$

printf$("$No output when clock pulse is $0")$;

return $1$;

$\}$

op$3=$ nand$($cp$,$ d$)$;

op$4=$ nand$($cp$,$ not$($d$))$;

$//$ Assuming previous values of q as $1$ and q$\text{'}$ as $0$

prev$\_$q $=1$;

prev$\_$q$1=0$;

q $=$ nand$($prev$\_$q$1,$ op$3)$;

q$1=$ nand$($prev$\_$q$,$ op$4)$;

printf$("$

Value of Q $=\%$d

$",$ q$)$;

printf$("$Value of Q$\text{'}=\%$d

$",$ q$1)$;

return $0$;

$\}$ I provided for you three codes that were written in C programming language. So please draw a flowchart for each and every one of the three of them Quickly, please.