Please answer the following code problem in PYTHON. DO NOT WRITE A NEW CODE, just INSERT the necessary addition to the given code below. Thank you. • You are employed by Microsoft. Unexpectedly, Minesweeper is gaining popularity again and users arerequesting for additional features. Your boss wanted you to help add features in the codebase. You aretasked to create a helper function that will display the maximum number of bombs that are clusteredtogether. This is so players can have an idea how scattered the bombs are.• Upon looking into the codebase, you saw that your coworker recently developed an implementation ofWeighted Quick Union with the intention of using it for another feature. When your boss found out, he/shetold you to use it so you can brush up on your data structures knowledge.• Given the Minesweeper board below, you should output "4" since the maximum number of bombs (markedas "x") that are beside each other is 4. Two bombs are considered beside each other if they are horizontallyor vertically touching (diagonals are not considered).x xXInput Format• You will be given a list of lists in the following form:[["x","x"," "," "1,["x","x"," "," "1,[" "," ","x","x"]]Constraints• You are required to use the provided WeightedQuickUnion class• assume all elements of the list are valid (i.e., only "x" and "" are in the list of lists)• assume all list of lists have valid and consistent sizes (i.e., no list will have a different size from other lists)Output Format• You are supposed to output the maximum number of bombs that form a group• The output should only be one numberSample Input 0["x", "x"," ","1,[" "," ","x","x"]]Sample Output 0Sample Input 1[[" ",""," "," "]]Sample Output 1 1import ast23 vclass WeightedQuickUnion:4 vdef _init_ (self, size: int) - None:6Initializes the union-find dssize: number of elements to initialize8self.size = sizeself.parent = [-1]*self.sizeself.group_size = [1]*self.size # create separate list to indicate the size for each element10# create a list where all elements are roots1112# (useful for knowing the size in root's perspective)13def _str_(self) - str:return f"parent: {self.parent}
size: {self.group_size}
"141516def get_root(self, p: int) - int:""Find the root of p"""171819idx = pwhile self.parent[idx] = 0:idx = self.parent[idx]20# root should have a negative value2122return idx23def is_connected (self, pl: int, p2:int) - bool:return self.get_root(pl) == self.get_root(p2)242526def connect(self, pl: int, p2: int) - None:""Connects pl and p2"""rl = self.get_root (pl)r2 = self.get_root(p2)rl_size = self.group_size[r1]r2_size = self.group_size[r2]if rl_size r2_size:self.parent[r2] = rlself.group_size[rl] += r2_sizeelse:27282930313233 -3435# increase rl group size by r2 size36self.parent[ri] = r2self.group_size[r2] += rl_size3738# increase r2 group size by rl size3940 vif -_name_-== "__main__":41board = input()42board = ast.literal_eval(board)num_rows, num_cols = len(board), len(board[0])uf = WeightedQuickUnion(size = num_rows num_cols)43444546##INSERT CODE HERE##

Question

Please answer the following code problem in PYTHON. DO NOT WRITE A NEW CODE, just INSERT the necessary addition to the given code below. Thank you. • You are employed by Microsoft. Unexpectedly, Minesweeper is gaining popularity again and users arerequesting for additional features. Your boss wanted you to help add features in the codebase. You aretasked to create a helper function that will display the maximum number of bombs that are clusteredtogether. This is so players can have an idea how scattered the bombs are.• Upon looking into the codebase, you saw that your coworker recently developed an implementation ofWeighted Quick Union with the intention of using it for another feature. When your boss found out, he/shetold you to use it so you can brush up on your data structures knowledge.• Given the Minesweeper board below, you should output &#34;4&#34; since the maximum number of bombs (markedas &#34;x&#34;) that are beside each other is 4. Two bombs are considered beside each other if they are horizontallyor vertically touching (diagonals are not considered).x xXInput Format• You will be given a list of lists in the following form:[[&#34;x&#34;,&#34;x&#34;,&#34; &#34;,&#34; &#34;1,[&#34;x&#34;,&#34;x&#34;,&#34; &#34;,&#34; &#34;1,[&#34; &#34;,&#34; &#34;,&#34;x&#34;,&#34;x&#34;]]Constraints• You are required to use the provided WeightedQuickUnion class• assume all elements of the list are valid (i.e., only &#34;x&#34; and &#34;&#34; are in the list of lists)• assume all list of lists have valid and consistent sizes (i.e., no list will have a different size from other lists)Output Format• You are supposed to output the maximum number of bombs that form a group• The output should only be one numberSample Input 0[&#34;x&#34;, &#34;x&#34;,&#34; &#34;,&#34;1,[&#34; &#34;,&#34; &#34;,&#34;x&#34;,&#34;x&#34;]]Sample Output 0Sample Input 1[[&#34; &#34;,&#34;&#34;,&#34; &#34;,&#34; &#34;]]Sample Output 1 1import ast23 vclass WeightedQuickUnion:4 vdef _init_ (self, size: int) -> None:6Initializes the union-find dssize: number of elements to initialize8self.size = sizeself.parent = [-1]*self.sizeself.group_size = [1]*self.size # create separate list to indicate the size for each element10# create a list where all elements are roots1112# (useful for knowing the size in root's perspective)13def _str_(self) -> str:return f&#34;parent: {self.parent}
size: {self.group_size}
&#34;141516def get_root(self, p: int) -> int:&#34;&#34;Find the root of p&#34;&#34;&#34;171819idx = pwhile self.parent[idx] >= 0:idx = self.parent[idx]20# root should have a negative value2122return idx23def is_connected (self, pl: int, p2:int) -> bool:return self.get_root(pl) == self.get_root(p2)242526def connect(self, pl: int, p2: int) -> None:&#34;&#34;Connects pl and p2&#34;&#34;&#34;rl = self.get_root (pl)r2 = self.get_root(p2)rl_size = self.group_size[r1]r2_size = self.group_size[r2]if rl_size > r2_size:self.parent[r2] = rlself.group_size[rl] += r2_sizeelse:27282930313233 -3435# increase rl group size by r2 size36self.parent[ri] = r2self.group_size[r2] += rl_size3738# increase r2 group size by rl size3940 vif -_name_-== &#34;__main__&#34;:41board = input()42board = ast.literal_eval(board)num_rows, num_cols = len(board), len(board[0])uf = WeightedQuickUnion(size = num_rows num_cols)43444546##INSERT CODE HERE##

Accepted Answer

# CODE below# #### INSERT CODE HERE ##### as STATED in the# PROBLEM STATEMENT.
# The code is…