21093 2003021093 2003021093 2003021093 2003021 Data Structures and Algorithms 21094 4) Assume an image NxM is given. We want to focus some area specially autofocus algorithm). A bundle of vertices that are stait connected are searched and different MST's are found. You can use any algorithm but don't forget to find all MST's in the image. a)Write the algorithm and calculate complexity? b) Assume a region near the midregion is selected afterwards(after finding all start shaped connected vertices). What is now the complexity X X X (x x x x Star shape connection (25 pnt)