Q8. Describe a graph that can be used to model the following problem: "Suppose you are driving around San Bernardino. Your goal is to drive on every single street. (Ignore that there are 1-way streets.) You want to drive on every street at most twice? " The model is described according to : { Vertex, Edge, Direction, Weight } \{Each street, Intersection, Directed, Unweighted\} \{Intersection, Each street, Directed, Unweighted\} \{Intersection, Each street, Undirected, Unweighted\} \{Intersection, Each street, Directed, Weighted\} Noe of these are valid