WILL YOU DRAW A FLOW CHART FOR THIS C PROGRAM?

#include

#include

$//$ Define the Node structure for the linked list

struct Node $\{$

int item;

struct Node$*$ next;

$\}$;

$//$ Function to create a new node

struct Node$*$ createNode$($int item$)\{$

struct Node$*$ newNode $=($struct Node$*)$malloc$($sizeof$($struct Node$))$;

newNode$->$item $=$ item;

newNode$->$next $=$ NULL;

return newNode;

$\}$

$//$ Function to insert a node in sorted order

void insertSorted$($struct Node$**$ head, int item$)\{$

struct Node$*$ newNode $=$ createNode$($item$)$;

$//$ Special case for the head or if newNode needs to be the new head

if $(*$head $==$ NULL $||(*$head$)->$item $>$ item$)\{$

newNode$->$next $=*$head;

$*$head $=$ newNode;

return;

$\}$

$//$ Locate the node before the point of insertion

struct Node$*$ current $=*$head;

while $($current$->$next $!=$ NULL && current$->$next$->$item $<$ item$)\{$

current $=$ current$->$next;

$\}$

$//$ Insert new node

newNode$->$next $=$ current$->$next;

current$->$next $=$ newNode;

$\}$

$//$ Function to print a linked list

void printList$($struct Node$*$ head$)\{$

struct Node$*$ current $=$ head;

printf$("\{")$;

while $($current $!=$ NULL$)\{$

printf$("\%$d$",$ current$->$item$)$;

if $($current$->$next $!=$ NULL$)$

printf$(",")$;

current $=$ current$->$next;

$\}$

printf$("\}$

$")$;

$\}$

$//$ Function to check if an item already exists in a linked list

int existsInList$($struct Node$*$ head, int item$)\{$

struct Node$*$ current $=$ head;

while $($current $!=$ NULL$)\{$

if $($current$->$item $==$ item$)$

return $1$; $//$ Item found

current $=$ current$->$next;

$\}$

return $0$; $//$ Item not found

$\}$

$//$ Function to perform the union of two sets $($lists P and Q$)$

void unionOfSets$($struct Node$*$ P$,$ struct Node$*$ Q$,$ struct Node$**$ R$)\{$

struct Node$*$ current $=$ P;

$//$ Insert elements from P into R

while $($current $!=$ NULL$)\{$

insertSorted$($R$,$ current$->$item$)$;

current $=$ current$->$next;

$\}$

$//$ Insert elements from Q into R $($only if not already in R$)$

current $=$ Q;

while $($current $!=$ NULL$)\{$

if $(!$existsInList$(*$R$,$ current$->$item$))\{$

insertSorted$($R$,$ current$->$item$)$;

$\}$

current $=$ current$->$next;

$\}$

$\}$

$//$ Main function

int main$()\{$

struct Node$*$ P $=$ NULL; $//$ List for set P

struct Node$*$ Q $=$ NULL; $//$ List for set Q

struct Node$*$ R $=$ NULL; $//$ List for the union set R

int n$,$ m$,$ item;

$//$ Input for set P

printf$("$Enter the number of elements in set P: $")$;

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

printf$("$Enter the elements of set P:

$")$;

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

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

insertSorted$($&P$,$ item$)$;

$\}$

$//$ Input for set Q

printf$("$Enter the number of elements in set Q: $")$;

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

printf$("$Enter the elements of set Q:

$")$;

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

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

insertSorted$($&Q$,$ item$)$;

$\}$

$//$ Compute the union of P and Q$,$ store in R

unionOfSets$($P$,$ Q$,$ &R$)$;

$//$ Print the three sets

printf$("$Set P $=")$;

printList$($P$)$;

printf$("$Set Q $=")$;

printList$($Q$)$;

printf$("$P union Q $=")$;

printList$($R$)$;

return $0$;

$\}$