Find the Cyclomatic Complexity of the following code segment: int average (int[ ] value, int min, int max, int N) { int i, totalValid, sum, mean; i = totalValid = sum = 0; while ( i < N || value[i] != -999 ) { if (value[i] >= min && value[i] <= max){ totalValid += 1; sum += value[i]; if (totalValid > 0) mean = sum / totalValid; else mean = -999; } i += 1; return mean; N.B. N=2466, min = 6, max = 15124 %3!

change the code to C language   #include<stdio.h>#include<conio.h>void menu();void getInput( char &, int & );float getprice( char ch , int n); int main() {char name[20], order[3][20];int table, quantity[3];char ch1,ch2,ch3;int n1,n2,n3;float price=0;float total=0;float pay=0;float change=0;int q1;int q2;int q3;printf ("\t -----------SUNNY CAFE ORDER FORM-----------\n"); printf("\t Customer Name :");scanf("\n%s",&name);printf("\t Table Number :");scanf("\n%d", &table);menu(); printf("\n\t Order 1: ");getInput(ch1, n1);printf("\t Order 1 quantity: ");scanf("%d", &q1);printf("\n");printf("\t Order 2: ");getInput(ch2, n2);printf("\t Order 2 quantity: ");scanf("%d", &q2);printf("\n");printf("\t Order 3: ");getInput(ch3, n3); printf("\t Order 3 quantity: ");scanf("%d", &q3);printf("\n");printf ("\t\t **********************************************\n");printf(" ~SUNNY CAFE~ \n");printf ("\t\t…

Find error  #include<bits/stdc++.h> using namespace std; class Solution{     public:     bool isPossible(vector<int>ank,int n,int mid)    {        int count=0;        for(int i=0;i<rank.size())        {            int val= (-1 + sqrt(1+(8*mid)/rank[i]))/2;             count+=val;         }                return count>=n;     }    int findMinTime(int N, vector<int>&A, int L){        int low=*min_element(A.end()),high=1000000;        int ans=high;        while(low<=high)        {            int mid=low+(high)/2;                        if(isPossible(A,mid))            {                ans=mid;                 high=mid;             }            else            low=mid;         }        return ans;    } };   int main() {  int t;  cin>>t;  while(t--)  {      int l;      cin >> l;      vector<int>arr(l);      for(int i = 0; i < l; i++){          cin >> arr[i];      }      Solution ob;      int ans = ob.findMin(n, *arr, l);      cout…

main.cpp:4:17: error: 'string' has not been declared 4 | void KMPSearch(string pat, string txt) main.cpp:4:29: error: string' has not been declared 4 | void KMPSearch(string pat, string txt) Aununun main.cpp:31:25: error: string' has not been declared 31 | void computelPSArray(string pat, int M, int[] lps) main.cpp:31:50: error: expected or . before lps' 31 | void computeLlPSArray(string pat, int M, int[] lps) main.cpp:55:8: error: expected :' before 'static' 55 | public static void Main() main.cpp:61:2: error: expected ;' after class definition 61 | } | main.cpp: In member function 'void GFG::KMPSearch(int, int)': main.cpp:6:15: error: request for member Length' in 'pat', which is of non-class type 'int' 6 | int M = pat.Length; main.cpp:7:15: error: request for member Length' in txt’, which is of non-class type 'int' int N = txt.Length; main.cpp:8:6: warning: structured bindings only available with -std3c++17' or (-std=gnu++17' 8 | int[] lps new int[M];

Convert please asap.

DATA STRUCTURES - JAVA

Select the appropriate code that performs selection sort. a)           int min;  for(int j=0; j<arr.length-1; j++)  {   min = j;   for(int k=j+1; k<=arr.length-1; k++)   {    if(arr[k] < arr[min])     min = k;   }   int temp = arr[min];   arr[min] = arr[j];   arr[j] = temp;        } b)           int min;  for(int j=0; j<arr.length-1; j++)  {   min = j;   for(int k=j+1; k<=arr.length; k++)   {    if(arr[k] < arr[min])     min = k;   }   int temp = arr[min];   arr[min] = arr[j];   arr[j] = temp;  } c)           int min;  for(int j=0; j<arr.length-1; j++)  {   min = j;   for(int k=j+1; k<=arr.length-1; k++)   {    if(arr[k] > arr[min])     min = k;   }   int temp = arr[min];   arr[min] = arr[j];   arr[j] = temp;  } d)           int min;  for(int j=0; j<arr.length-1; j++)  {   min = j;   for(int k=j+1; k<=arr.length; k++)   {    if(arr[k] > arr[min])     min = k;   }   int temp = arr[min];   arr[min] = arr[j];   arr[j] = temp;  }

JAVA Programming Write a function that returns true if you can partition an array into one element and the rest, such that this element is equal to the product of all other elements excluding itself. Examples canPartition ([2, 8, 4, 1]) → true // 8 = 2 x 4 x 1 canPartition ([-1, -10, 1, -2, 20]) → false canPartition ([-1, -20, 5, -1, -2, 2]) true