on 10 When is breadth-first search is optimal? red sout of question a. When there is less number of nodes O b. When all step costs are equal O c. When all step costs are unequal O d. None of the mentioned 11 K-means clustering is it out of Question O a. K-means clustering is a type of unsupervised learning that operates on unlabeled data O b. K-means clustering is a type of supervised learning that operates on unlabeled data Oc. K-means clustering is a type of unsupervised learning that operates on labeled data d. None of the above