please its my humble request don't use Chegg for this question.

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 a cell that is part of the skyscraper, and 0's represent cells that are empty air. You will join the path to the other skyscraper by adding planks to spots containing 0'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