Write a C++ program that either an adjacency matrix or adjacency list (your choice), Use this matrix or list to find all paths from vertex A to vertex G. The adacency matrix is a 2 x 2 array. The list is several linked lists. NOTE: your prigram must find the path. Then output the path. 3 points extra if your program takes the origin vertex and destination vertex entered by user.