Write a program that reads data from a file containing a datum called prefix in each line of the file called routing$\_$table. Each prefix has the format of IP$/$length as following examples: $0\mathrm{.}2\mathrm{.}64\mathrm{.}0/15$

$0\mathrm{.}3\mathrm{.}8\mathrm{.}0/22$

$1\mathrm{.}3\mathrm{.}33\mathrm{.}0$

$1\mathrm{.}3\mathrm{.}38\mathrm{.}0/23$

The first part a$.$b$.$c$.$d is a $32-$bit IP address. So$,$ you have to store the IP address into an unsigned variable. For prefixe length, you can use an unsigned character. So$,$ for all the prefixes, you can use an array of struct prefix $\{$unsigned ip; unsigned char len; struct prefix $*$next; $\}$ to store all the prefixes. Assume prefix $0\mathrm{.}0\mathrm{.}0\mathrm{.}0/0$ does not exist.

Do the following,

$($a$)$ write a function input$(..)toreadalltheprefixesfromtheinputfile$

$($b$)$ print out the total number of prefixes in the input file,

$($c$)$ write a function length$\_$distribution$(..)$ to compute the number of prefixes with prefix length $i,$ for $i=0$ to $32,$

$($d$)$ write a function segment int $d)$ to divide the prefixes into $2^d$ groups such that the prefixes in the same group have the same first $d$ bits.

$($e$)$ Now, the prefix of length $ii={02}^d-1$ are put $in$ a special group $so$ that $no$ prefix duplicate $is$ created.

$(f)$ printout the number $of$ prefixes $in$ group i for $i=0to{2}^d-1.$

$(g)$ For each group, you have $to$ use $singly$ linked list $to$ chain the prefixes together.

$(h)$ Therefore, you have $to$ write a function $prefi{x}_i$nsert$()to$ insert a prefix $in$ a one$-by-$one fashion $in$ the increasing order $of$ the unsigned numbers $of$ the prefixes. The prefixes $tobe$ inserted after the segments are built are from a file called $inserte{d}_p$refixes.

$(i)$ Also, you have $to$ write a function $prefi{x}_d$elete$()to$ insert a prefix. The prefixes $tobe$ deleted after inserting all the prefixes from files $routin{g}_t$able and $inserte{d}_p$refixes are from a file called $delete{d}_p$refixes.

$(j)$ you have $to$ write a function search$()by$ giving $anIP$ address $to$ report $if$ the search $is$ successful $or$ fails.

$(k)$ Finally, you have $to$ report average numbers $of$ search, insert, delete clock cycles, draw three figures $as$ followe