Gien. fr Cin; i>=l; 1=2){ for Cjsl; j L= lugli); j++){ ocn) ; Some thing Ocn) 3 3 what is te time complexity?

the code is in ada   with Ada.Numerics.Generic_Elementary_Functions; package body Number_Theory is    -- Instantiate the library for floating point math using Floating_Type.   package Floating_Functions is new Ada.Numerics.Generic_Elementary_Functions(Floating_Type);   use Floating_Functions;    function Factorial(N : in Factorial_Argument_Type) return Positive is   begin      -- TODO: Finish me!      --      -- 0! is 1      -- N! is N * (N-1) * (N-2) * ... * 1      return 1;   end Factorial;    function Is_Prime(N : in Prime_Argument_Type) return Boolean is      Upper_Bound     : Prime_Argument_Type;      Current_Divisor : Prime_Argument_Type;   begin      -- Handle 2 as a special case.      if N = 2 then         return True;      end if;       Upper_Bound := N - 1;      Current_Divisor := 2;      while Current_Divisor < Upper_Bound loop         if N rem Current_Divisor = 0 then            return False;         end if;         Upper_Bound := N / Current_Divisor;      end loop;…

I need help in solving the question highlighted in bold for C language. Given- struct tag { char ch; int i; };   struct bTag{  float f;  double d; };   struct cTag{ struct  aTag a; struct  bTagb; int A[5]; }; typedef struct aTag aType; typedef struct bTag bType; typedef struct cTag cType; aType a, A[5]; bType b, B[5]; cType c,  C[5]; aType  *pa; bType  *pb; cType  *pc; 1a). Implement a function void InputFunc1(cType *ptr) that will input via scanf() the members of the structure pointed to by ptr. Assume that the memory space already exist. b). Implement a function cType InputFunc2(void) that will declare a local variable as cType temp. The function will then input the values of the members of temp using scanf(). Finally, the function will return temp. c) Implement a function void InputFunc3(cType C[], int n) that will input via scanf() the elements of the array of structure C. Parameter n represents the number of elements in the array. d) Implement a function void OutputFunc1(cType…

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; if (value[i] >= min && value[i] 0) mean = sum / totalValid; else mean = -999; } i += 1; } return mean; N.B. N=2466, min = 6, max = 15124

Data Structure Using C++  I need a function like this ::: float postfixEval(string postfix) {int a, b;stack<float> stk;string::iterator it;for(it=postfix.begin(); it!=postfix.end(); it++) {//read elements and perform postfix evaluationif(isOperator(*it) != -1) {a = stk.top();stk.pop();b = stk.top();stk.pop();stk.push(operation(a, b, *it));}else if(isOperand(*it) > 0) {stk.push(checkNumber(*it));}}return stk.top();} to evaluate postfix with more one digit in expression (multi digits) please just this function simple like the above

2. A piece of declaration code in C programming language is as follows: typedef struct {     int a, b; } CELL, *PCELL; CELL foo[100]; PCELL bar ( int x, CELL y ); Write the type expression for foo and bar.   3. Write an SDT for the following grammar, which can perform type checking. The type of S is the valid type of its body.  S -> id := E | if E then S | while E do S | S; S