Question

C# Code please with picture of code.Thanks!

1. Create a Main method, and create a 2D integer array called data, with a size of five (5) by five (5). Ask the user to input the values for this array (Scanner’s nextInt)

1. 2.Create a method called LongestPositiveSeries, that takes in a 2D array and finds the length of the longest continuous series of positive numbers in it.
   For example, if we had an array like this:

0	1	2	3	4
5	-1	-5	-5	5
3	-2	56	25	-15
0	5	5	0	324
46	25	0	0	0

• • The length would be 5. For this problem, 0 is considered non-negative and not positive, so we start counting from index [0, 1] (which is 1) to [1, 0] (which is 5) and end at index [1, 1] (which is –1).
• • Hint: Consider using a basic linear search and modifying it to keep track of the current positive streak of numbers.

1. 3. Call that method in your Main, for the array data.
2. 4. Print out the returned result from your method in your Main, along with the content of data.
3. C# CODE

Answer 1

Code -

using System;
public class MultiArrayExample
{
public static void Main(string[] args)
{
//2d array initialized
int[,] arr = { { 0, 1, 2, 3, 4 }, { 5, -1, -5, -5, 5 }, { 3, -2, 56, 25, -15 }, { 0, 5, 5, 0, 324}, { 46, 25, 0, 0, 0 } };//declaration and initialization
//print the output return by LongestPositiveSeries function
Console.Write("Longest Positive Series: "+LongestPositiveSeries(arr));
}
//function to return LongestPositiveSeries
public static int LongestPositiveSeries(int[,] arr){
//variable declare
int maxCount = 0,maxCountNow =0;
//iterate through array
for(int i=0;i<5;i++){
for(int j=0;j<5;j++){
//compare arr[] is less than 0
if(arr[i,j]<=0){
if(maxCount<maxCountNow){
maxCount = maxCountNow;
}
maxCountNow = 0;
}
//if arr[] is greater than 0
if(arr[i,j]>0){
maxCountNow++;
}
}   
}
return maxCount;
}
}

Screenshots -

pls do give a like thank you