In a given dataset, there are M columns. Out of these M$,$ m columns are chosen each time for creating training samples for the individual trees in a random forest. What will happen if

A $-$ m is almost equal to M

B $-$ m is very small A will result in a weak tree but B will result in a very robust tree