2/ Algorithms on 2D Arrays - 10 points We call a 2D array full if all of its rows have the same number of elements. When a 2D array is not full, we call it jagged or ragged. Now, let's say that you are given a non-empty 2D array of integers (which may or may not be full/jagged/ragged). You are also given a row index. You are tasked with checking whether row at the given index is sorted in increasing order. Example 1: Given the following 2D array: 123 1234 12 123456 and the row index 1, your job is to check if row at index 1, which is 1 2 3, is sorted in increasing order or not. In fact, it is. Your method on this 2D array and index will return true