Suppose you have the following search space: State
next
cost

A
B
4

A
C
1

B
D
3

B
E
8

C
C
0

C
D
2

C
F
6

D
C
2

D
E
4

E
G
2

F
G
8

Draw the state space of this problem.

Assume that the initial state is A and the goal state is G. Show how each of the following search strategies would create a search tree to find a path from the initial state to the goal state:
Breadth-first search
Depth-first search
Uniform cost search

​

Breadth

Depth

Uniform

U

the answer to your question would be something called hertz. the unit of measurement called a hertz, which is one cycle per second, is used to measure clock speed. within one cycle, your computer processes, refreshes, or updates itself to the changes that it is going through. in the case of computer clock speed, one hertz equals one tick per second. the clock speed of computers is usually measured in megahertz (mhz) or gigahertz (ghz)