Answer:
B.O(n).
Explanation:
If the graph is represented by adjacency matrix then we can find all the neighbors of a given vertex in O(n) time because each row in adjacency matrix consists the track of the neighbors.If the other vertex is a neighbor then it contains 1 in adjacency matrix if not it contains 0.So we have to iterate over that row of the vertex to find the neighbors.
I don't know but I am guessing 666 or 777 or 888.
Answer: Burn or Write
Explanation:
Burn is a colloquial term meaning to write content to a CD , DVD , or other recordable disc. DVD and CD drives with recording capabilities (sometimes called DVD or CD burner s) etch data onto the disks with a laser .
122.255.255.255
--------------------------------
