What is boolean algebra? It is a set of rules that allow you to manipulate boolean expressions and equations. De Morgan's laws are two of the many rules in boolean algebra. I think this question is about using De Morgan's laws to simplify a boolean expression.
The expression you found is not the formula the author of the question wanted you to find. Your formula can be simplified using boolean algebra, but it does not require De Morgan's laws to simplify. So if you want to see De Morgan's laws in action, you need another formula.
F = abC + AbC + aBC
This can also be written:
F = (~A and ~B and C) or (A and ~B and C) or (~A and B and C)
where the ~ means "not" or "= 0". The benefit of writing it this way is that De Morgan's laws can be given:
1. ~(A and B) = ~A or ~B
2. ~(A or B) = ~A and ~B
You couldn't write either of these using capital and small letters.
But your formula does not need these laws to be simplified. If you look at X1 in the circuit, it is a combination of A and CLK according to that logic gate. One might say:
X1 = ac + aC + Ac
or one might say
X1 = ~(A and C)
These are just the same. If you can see that these are the same, then consider how I found this formula. It is just the definition of a NAND gate.
And now you should be able to use the logic gates in the picture to build up the formula that the author wanted you to find, the one that needs De Morgan's laws to simplify.