If you scrutinize the data sheet for a real D-FF carefully, you will see an item called 'setup time'. In actuality, the FF doesn't grab the value at the exact time of the clock edge; the data has to be stable for the last 20 ns or so before the clock rises, and that's the value that gets transferred. Also, the value at the output takes a few ns to settle down to the (possibly) changed value. So if you daisy chain a string of D-FF's together, Q from one into the D of the next, everything works because during the critical time for each stage's D input, the Q's are stable; the Q's only change very shortly after the active clock edge.
One reason we clock flip flops so that there isn't any chaos when the outputs of flip flops are fed through some logic functions and back to their own inputs.
If a flip-flop's output is used to calculate its input, it behooves us to have orderly behavior: to prevent the flip-flop's state from changing until the output (and hence the input) is stable.
This clocking allows us to build computers, which are state machines: they have a current state, and calculate their next state based on the current state and some inputs.
For example, suppose we want to build a machine which "computes" an incrementing 4 bit count from 0000 to 1111, and then wraps around to 0000 and keeps going. We can do this by using a 4 bit register (which is a bank of four D flip-flops). The output of the register is put through a combinatorial logic function which adds 1 (a four bit adder) to produce the incremented value. This value is then simply fed back to the register. Now, whenever the clock edge arrives, the register will accept the new value which is one plus its previous value. We have an orderly, predictable behavior which steps through the binary numbers without any glitch.
Clocking behaviors are useful in other situations too. Sometimes a circuit has many inputs, which do not stabilize at the same time. If the output is instantaneously produced from the inputs, then it will be chaotic until the inputs stabilize. If we do not want the other circuits which depend on the output to see the chaos, we make the circuit clocked. We allow a generous amount of time for the inputs to settle and then we indicate to the circuit to accept the values.
Clocking is also inherently part of the semantics of some kinds of flip flops.
A D flip flop cannot be defined without a clock input. Without a clock input, it will either ignore its D input (useless!), or simply copy the input at all times (not a flip-flop!) An RS flip-flop doesn't have a clock, but it uses two inputs to control the state which allows the inputs to be "self clocking": i.e. to be the inputs, as well as the triggers for the state change. All flip flops need some combination of inputs which programs their state, and some combination of inputs lets them maintain their state. If all combinations of inputs trigger programming, or if all combinations of inputs are ignored (state is maintained), that is not useful. Now what is a clock? A clock is a special, dedicated input which distinguishes whether the other inputs are ignored, or whether they program the device. It is useful to have this as a separate input, rather than for it to be encoded among multiple inputs.
Best Answer
We don't just outright give answers to homework problems here, but will help you to solve them yourself if you cooperate.
First, take the prime factors of 6 to see if the problem can be broken up and simplified. Powers or 2 can be directly realized by binary counters.
The factor of 3 makes this more interesting. 3 is a low number, so one option is a chain of flip-flops. Other ways to divide by arbitrary numbers is to use a binary counter, then reset it when it gets to a certain value. Look up something called a divide by N counter.