Find the output of the following code. Public class Solution{ Public static void main(String args[]){ Int i; for(i = 1; i < 6; i++){ if(i > 3) continue; %3D } System.out.println(i); }

class TenNums {private:    int *p; public:    TenNums() {        p = new int[10];         for (int i = 0; i < 10; i++) p[i] = i;     }    void display() { for (int i = 0; i < 10; i++) cout << p[i] << " "; }};int main() {    TenNums a;      a.display();      TenNums b = a;      b.display();      return 0;} Continuing from Question 4, let's say I added the following overloaded operator method to the class. Which statement will invoke this method? TenNums TenNums::operator+(const TenNums& b) {  TenNums o;  for (int i = 0; i < 10; i++) o.p[i] = p[i] + b.p [i];  return o;} Group of answer choices TenNums a; TenNums b = a; TenNums c = a + b; TenNums c = a.add(b);

import java.util.Scanner; public class LabProgram {      // Recursive method to draw the triangle    public static void drawTriangle(int baseLength, int currentLength) {        if (currentLength <= 0) {            return;  // Base case: stop when currentLength is 0 or negative        }         // Calculate the number of spaces needed for formatting        int spaces = (baseLength - currentLength) / 2;         if (currentLength == baseLength) {            // If it's the first line, don't output spaces before the first '*'            System.out.println("*".repeat(currentLength) + " ");        } else {            // Output spaces and asterisks            System.out.println(" ".repeat(spaces) + "*".repeat(currentLength) + " ");        }         // Recursively call drawTriangle with the reduced currentLength        drawTriangle(baseLength, currentLength - 2);    }        public static void drawTriangle(int baseLength) {        drawTriangle(baseLength, baseLength);    }     public static…

public class Main {      static int findPosSum(int A[], int N)  {  if (N <= 0)    return 0;       {      if(A[N-1]>0)      return (findPosSum(A, N - 1) + A[N - 1]);      else      return findPosSum(A, N - 1);     }   } public static void main(String[] args)  {    int demo[] = { 11, -22, 33, -4, 25,12 };  System.out.println(findPosSum(demo, demo.length));  } }  Consider the recursive function you wrote in the previous problem. Suppose the initial call to the function has an array of N elements, how many recursive calls will be made? How many statements are executed in each call? What is the total number of statements executed for all recursive calls? What is the big O for this function?