Max separationsYou are working in the Date Consistency team of your company You are allocated a task as follows You have a data stream consisting of an equal number of odd and even numbers. You can make separations in the data stream but the number of odd elements should be equal to the number of even elements in both partitions after separation. Also, if you make a separation between a number x and number y$,$ then the cost of this operation will be lx$-$yl coins$\mathrm{.}69$You are given the following: An integer N An array arr An integer KFind out the maximum number of separations that can be made in the array by spending no more than K coins.Function descriptionComplete the function solve This function takes the following $3$ parameters and returns the required answer N Represents the size of the data stream K$.$ Represents the limit of coinsarr. Represents the data streamInput format for custom testingNote: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code The first line contains the integer N$.$ The second line contains integer K$.$ The third line contains N integers denoting the data stream.Output formatPrint the maximum number of separations that can be made in the array by spending no more than K coins.Constraints$2<=$ N $<=1001<=$ K $<=1001<=$ arri $<=100$Sample input:$4101324$Sample output:$0$ExplanationIt is not possible to make even one cut even with an unlimited number of coins as the condition for valid separation can not be fulfilled in any separation.def Max$($N$,$ K$,$ arr$)$:Write your code here Test case $1$Input$4101324$Expected output:$0$Test case $2$Input$6100123456$Expected output: $2$Test case $3$Input$21001378$Expected output:$0$Test case $4$Input$101009465244729\text{'}982065617$Expected output:$2$