Answer
can we get a picture of the problem ?
Explanation:
Answer:
goku comes in and turns super sayain naruto come in with kurama and naruto get goku with a rasagen and geku is still fist fightin while naruto is using his kurama and turns into kurama and knocks out goku now naruto thinks he won and goku IS HITIN HIM WITH A KAMEKAMEHA GOKU IS SIROUS NOW
Explanation:
A Network is definitely a Tree when any of the below properties matched.
Explanation:
A Network is synonym for connected graph. Connected graph is a graph is a path which will connect from vertex to vertex.
A Tree is a network that has no circuit. network can be differed from tree by three key properties
1. Single path property - one path connecting two vertices
2. All bridges property - every edge of a network is a bridge
3. N-1 edges property - N vertices has N-1 edges
To determine this we use to N-1 edges property as given number of vertices and no bridges.
If a network has 15 vertices it must have 15-1= 14 edges to become a tree
I think the corret answer would be C
A computer BIT is the amount of data that a CPU can manipulate at one time.
