This is a Data Structures and Algorithms programming question. I translated this from C++ to C# Please make all the necessary corrections so that it may debug. Also, please recommend a good software that has a good ide for C#, VisualStudio2019 isn't that good haha

using System;

public class Program { public static void Main() { int n[10] = { 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536 };

//two decimal places

String.Format("{0:0.00}", start1, stop1, start2, stop2, time1, time2);

//for loop #1

for(int x = 0; x

//for loop #2

for (int = 0; int

start1 = clock(); for (i = 0; i

//Using Version 2 of the problem

start2 = clock(); for (j = 0; j

time1 = (stop1 - start1) / double(CLOCKS_PER_SEC);

Console.WriteLine("For n = "

time2 = (stop2 - start2) / double(CLOCKS_PER_SEC);

Console.WriteLine("Version 2: "

Console.WriteLine("------------------------------------------------- ");

for (int = 0; i

} }//This was translated from C++, please correct this code using C# //Hypothesis: Since both number of operations #1 and #2 are the same, they will run at about the same time

1. Write a program, using your favorite computer (under some operating system that must support VMM and your favorite programming language, which demonstrates that the timings of matrix addition d e substantially for large enough matrices, depending whether you use Version Tor Version 2 for i:=1 to n do for g:-1 to n do for i:=1 to n do for i:=1 to n do C[. 1: -A[1.31+B(1,31 C[1,1]:-A[1.31+B[1.31 Version 1 Version 2 Specifically, use this sequence of values for n. 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, and 65536, and study the timings of both versions. (Be aware that some runs may take longer than you are willing, or able to waitt) Keep in mind that the two versions should have the same timings and the doubling the value of n should result in a quadrupling of time spent to do the addition, assuming everything were done in core (which is of course not the case, since the last value corresponds to a memory requirement of almost so Gigabytes, assuming four bytes per word). Note that you must initialize your matrices A and B but the time required for this should not be part of the measurements