Please use your own code, don't copy from a websiteC++ **Title: Shortest Path Between Skyscrapers in a 2D Grid****Description:**This problem involves finding the shortest possible path between two skyscrapers in a 2D grid. The goal is to determine the minimum number of planks needed to construct the path.**Instructions:**1. **Input Details**: You are given a string representing a 2D array of integers, indicating the locations of the skyscrapers.2. **Grid Definition**: - Each skyscraper is defined as a group of 1's that are connected directionally (North, South, East, or West). - 0's represent empty spaces, which each equate to one unit of distance.3. **Path Construction**: - You can place planks only on 0's and must connect them to a skyscraper or another plank. - Movement is restricted to 4 directions (no diagonal movements allowed).4. **Objective**: Return the smallest number of planks needed to connect the two skyscrapers.**Example Cases**:- **Case 1**: - **Input**: `[[1,0,0,0],[0,0,0,0],[0,1,0],[0,0,1]]` - **Output**: 2- **Case 2**: - **Input**: `[[1,1,0,0,0],[1,0,0,0,0],[0,0,0,1,1],[0,0,1,1],[0,1,0,0,0]]` - **Output**: 3- **Case 3**: - **Input**: `[[0,0,0,0,0,0,0,0],[0,1,1,0,0,0,1,1],[0,0,1,1,1,0,0],[0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0]` - **Output**: 4**Assumptions**:- The grid contains exactly two skyscrapers.- The distance between the skyscrapers is at least 1.- An unlimited number

According to the information given:- We have to create the matrix program in which we find out the…

Please use your own code don't copy it from a website Given an string representing a 2D array of integers that contains the locations of the two skyscrapers, find the shortest possible path that connects the two skyscrapers and return the length of that path. A skyscraper is defined to be a 4- directionally connected group (i.e. North-South-East-West, no diagonals), and can consist of multiple "parts" such that the initial size of the skyscraper is not one single cell. 1's represent alcell that is part of the skyscraper, and O's represent cells that are empty air. You will join the path to the other skyscraper by adding planks to spots containing O's where each cell represents one unit of distance. You can only add planks to spots connected to either a skyscraper or another 2x4 (i.e. you cannot "jump" over a gap), and you can only do so 4-directionally. Return the smallest number of planks needed to make the crossing. Case 1: Input: {[1,0,0,0],[0,0,0,0],[0,1,1,0],[0,0,1,1]} Output: 2 Case 2: Input: {[1,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,1,1],[0,1,1,0,0]} Output: 3 Case 3: Input: {[0,0,0,0,0,0,0,0,0,0],[0,0,1,1,0,0,1,0,1,1],[0,0,0,1,1,1,1,0,1,0], [0,0,1,1,0,1,1,1,1,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0], [0,0,0,0,0,0,0,0,0,0], [1,0,0,0,0,0,0,0,0,0],[1,1,0,0,1,1,0,0,1,0], [1,1,1,1,1,1,1,1,1,0]} Output: 4 Assumptions: There are only 2 skyscrapers, and the distance between them will always be at least 1. You have an unlimited amount of planks and you are a super intelligence Computer Scientist, so you don't have to only utilize the shortest distance you just need to FIND the shortest distance. In other words, if you filled the entire 2D array with planks and used that to find the shortest distance, that is a perfectly valid solution. You do not have to keep the values in an array (though I might recommend it), you can utilize vectors/Linked Links/BSTS, ect. The maximum size of the grid is 100x100, and all matrices are of size m x m, where m is some size 2 to 100.