We have two algorithms A and B$.$ Algorithm A breaks a problem into three$(3)$ problems of size n$//2.$ Algorithm B breaks the same problem into four problems of size n$/3.$ Which algorithm should you prefer, and why, when:

a$)$ The cost of decomposition and composition of the individual solutions is n

b$)$ The cost of splitting and composing the individual solutions is n$^2$