Arrange the following steps in the proper sequence for simplifying a Boolean function using a Karnaugh map (K-map).
(A) Identify and group the largest possible clusters of 1's
(B) Draw the K-map for the given Boolean function
(C) Write the simplified Boolean expression from the grouped clusters
(D) Transfer the truth table values to the K-map
Choose the correct answer from the options given below:

1. A(B), (D), (A), (C)
2. B(D), (B), (A), (C)
3. C(B), (A), (D), (C)
4. D(A), (B), (C), (D)

Pick an option to check yourself, or open the answer below.