Edit the code so that it fufils the requirements.

Create a C program file named longest$\_$streak.c$.$ In that file, write a function with the following signature: unsigned longest$\_$streak$($int$[],$ unsigned$)$

The function takes an int array and its length as arguments and returns the longest streak. By longest streak, we mean the largest number of times the same value appears consecutively in the array. For example, if int test$1[]=\{1,2,3,2,4,4,4,2,1,1\},$ then longest$\_$streak$($test$1,10)$ should return $3$ because the longest streak consists of $3$ consecutive values $($the value $4$ appears $3$ consecutive times$).$ If the length is $0,$ the function should return $0.$

Hint: you can create a main$()$ method inside of longest$\_$streak.c or in a separate $.$c file for testing the longest$\_$streak$()$ function while you develop it$.$

Create a header file named longest$\_$streak.h so that other code that wants to use your function can #include "longest$\_$streak.h$".$ Include a header guard. $($Note: a header guard is not strictly necessary in this case since you only have declarations, not definitions, but it is good practice.$)$

$($Comment$-$out the main method from longest$\_$streak.c if it exists and ensure there are no print statements in the longest$\_$streak$()$ function.

longest$\_$streak.h:

#ifndef LONGEST$\_$STREAK$\_$H

#define LONGEST$\_$STREAK$\_$H

unsigned longest$\_$streak$($int arr$[],$ unsigned length$)$;

#endif $//$ LONGEST$\_$STREAK$\_$H

longest$\_$streak.c:

#include "longest$\_$streak.h$"$

unsigned longest$\_$streak$($int arr$[],$ unsigned length$)\{$

if $($length $==0)$ return $0$;

unsigned max$\_$streak $=1$;

unsigned current$\_$streak $=1$;

for $($unsigned i $=1$; i $$ length; i$++)\{$

if $($arr$[$i$]==$ arr$[$i $-1])\{$

current$\_$streak$++$;

$\}$ else $\{$

if $($current$\_$streak $>$ max$\_$streak$)\{$

max$\_$streak $=$ current$\_$streak;

$\}$

current$\_$streak $=1$;

$\}$

$\}$

if $($current$\_$streak $>$ max$\_$streak$)\{$

max$\_$streak $=$ current$\_$streak;

$\}$

return max$\_$streak;

$\}$

int main$()\{$

int test$1[]=\{1,2,3,2,4,4,4,2,1,1\}$;

unsigned length $=$ sizeof$($test$1)/$ sizeof$($test$1[0])$;

unsigned result $=$ longest$\_$streak$($test$1,$ length$)$;

printf$("$Longest streak: $\%$u

$",$ result$)$; $//$ Expected output: $3$

return $0$;

$\}$