In this lab, you are asked to complete similars.c program file which has been already given in Moodle. Inthis program, there are four functions, namely, main, hash$\_$text, strong$\_$similar, and weak$\_$similar.main function is already provided, and it is supposed to remain as it is $($you should not change it$).$ You arerequired to implement hash$\_$text, strong$\_$similar, and weak$\_$similar functions. Although this lab is verysimilar to the previous lab, in this time, you will solve your problem using structures.There are a few global declarations in the program which are listed as below:Definitions of constant macros as follows: STR$\_$LEN, MAX$\_$ELEM, and HASHSIZE.A structure defined with several elements to keep the name, last name, name$\_$lastname, andstrong hash and weak hash values. The name of the defined type is Student. The hash values,and all other critical information is kept as a record by using the structure of the type of Student. Prototypes of the functions listed above.Here are the operations performed in main function:An array of records in the type of Student is created and initialized to some values. Although thehash values are set to zero, the names are initialized.In the for loop, the name $-$ lastname pairs are concatenated and the hash values for strongsimilarity are computed.strong$\_$similar function is called to find the same name$-$lastname pairs and fill the twodimensionalarray called same to keep the mapping of similarities.The name$-$lastname pairs, the calculated hash values and similarity mapping is printed on thestandard output.weak$\_$similar function is called to calculate the hash values of each name and surname separately,then build the weak similarity mapping using hash values calculated.The name $-$ lastname pairs, and weak similarity mapping is printed on the standard output.Task $1$: Implement hash$\_$text function.unsigned int hash$\_$text $($char $*$ list$)$ ;A character pointer holding names and surnames is sent as an input, and the hash value of the input textis returned. During the calculation a basic formula is used as follows when the name is ali. The ascii codefor a is $97,$ for l is $108$ and for i is $105.$ The function calculates the hash value by the following formula;hash $=262*97+26*108+105$The algorithm should be applied to all symbols including whitespaces between name and surname. At theend mod $1000$ of hash value should be returned.hash $=$ hash mod $1000$ Consider the below example run:elements with hash valuesahmet yuksel $978$mehmet arslan $88$mustafa kemal $482$ali kemal $314$mustafa kemal $482$mustafa kemal $482$mehmet arslan $88$kemal ahmet $506$ali kaan $428$kemal kaan $740$ Task $2$: Implement strong$\_$similar function.void strong$\_$similar $($Student studentList$[$MAX$\_$ELEM$],$ intmap$[$MAX$\_$ELEM$][$MAX$\_$ELEM$])$Calculated hash values of all names$-$lastname pairs are sent to the function. The function modifies andreturns the map of exact matches. Exact matching of the entries is calculated only by using hashed values.Consider the below example run:The matches are calculated and printed through the main program by calling the strong$\_$similarfunction. Once the strong$\_$similar function is called in main function, the above output is printed.elements with hash valuesahmet yuksel $978$mehmet arslan $88$mustafa kemal $482$ali kemal $314$mustafa kemal $482$mustafa kemal $482$mehmet arslan $88$kemal ahmet $506$ali kaan $428$kemal kaan $740$elements with hash values and similarities:ahmet yuksel $978$mehmet arslan $886$mustafa kemal $48245$ali kemal $314$mustafa kemal $48225$mustafa kemal $48224$mehmet arslan $881$kemal ahmet $506$ali kaan $428$kemal kaan $740$ Task $3$: Implement weak$\_$similar function.void weak$\_$similar $($Student studentList$[$MAX$\_$ELEM$],$ int map$[$MAX$\_$ELEM$][$MAX$\_$ELEM$])$Array of structure of the type of Student is sent as input and previously calculated similarity map is sentas input$-$output parameter.The function calculates hash values of names and lastnames for each pair separately by calling hash$\_$textfunction. Once the hash values of all names and lastanmes are calculated the function updates the maparray to mark the weak similarities $($either names or surnames are same$).$ For example;ali kemal and mustafa kemal are weakly similar. They both are weakly similar to kemal ahmet.Consider the below example run:Once the weakly$\_$similar function is called in main function, the above output is printed.elements with weak similarities:ahmet yuksel $9787$mehmet arslan $88$mustafa kemal $482379$ali kemal $314245789$mustafa kemal $482379$mustafa kemal $482379$mehmet arslan $88$kemal ahmet $506023459$ali kaan $42839$kemal kaan $740234578$ Once the weakly$\_$similar function is called in main function, the above output is printed.