In computer graphics, triangulations are used to represent surfaces. Graphics libraries like OpenGL support a special type of triangulation called a strip, which is defined as follows. For n greaterthanorequalto 3, given a sequence of vertices V = (v_1, v_2, ..., v_n), the strip of V consists of the n - 2 triangles (v_i, v_i + 1, v_i + 2), for 1 lessthanorequalto i lessthanorequalto n - 2. See Figure 1. Assume that you are given an n-sided, x-monotone simple polygon P as a sequence of vertices in counterclockwise order. 1. Give an algorithm to decide if P can be triangulated as a strip of the form given above. 2. Give a rigorous proof of correctness and derive the running time of your algorithm. In computer graphics, triangulations are used to represent surfaces. Graphics libraries like OpenGL support a special type of triangulation called a strip, which is defined as follows. For n greaterthanorequalto 3, given a sequence of vertices V = (v_1, v_2, ..., v_n), the strip of V consists of the n - 2 triangles (v_i, v_i + 1, v_i + 2), for 1 lessthanorequalto i lessthanorequalto n - 2. See Figure 1. Assume that you are given an n-sided, x-monotone simple polygon P as a sequence of vertices in counterclockwise order. 1. Give an algorithm to decide if P can be triangulated as a strip of the form given above. 2. Give a rigorous proof of correctness and derive the running time of your algorithm