The divide-and-conquer approach is an efficient technique for solving complex problems in computer science. To find the largest item in a list of n items using this approach, the list is divided into:

a) Two sublists of equal size.
b) Two sublists of different sizes.
c) Three sublists of equal size.
d) Multiple sublists of varying sizes.