Given a graph data structure: G = (K, R) where, K= { +, -, *, / ,%, = } R= { (+,*), (=,%), (=,+), (+,/), (-,/), (*,-) } a) Draw the graph above. b) c) How many spanning trees does the graph have? Draw all spanning trees of the graph, which are also "linear" (each graph node has no more than two neighbors).