Given the following image pixel intensity values I=[102103] (c) Find the minimum non-trivial graph cut using the matrix formulation way shown in class. You may (and should) use function like svd do eigen-decomposition for you. You'll likely need to read its documentation to understand how to the inputs and outputs work. Show the intermediate matrices needed for your eigen-decomposition, namely D and W, and what the chosen eigenvalue/vector pair is. Finally draw your new (cut) graph (and include that image) and/or just tell us which pixels belong to which groups. (10pts)