1. Create a 2-dimensional array with 8 rows and 6 columns. Fill the array with random 3 digit integers. 2. Create a function called findLargestSum which returns the sum of the row with the largest sum. ex. int array[3]13]13, 6, 8), // sum17 (2, 4, 5), // sum11 θ,
OR
OR