What's the time complexity for brute-force matching of a text string of size n and a patter of size m?文本串T的长度为n，模式串P的长度为m，蛮力匹配算法的最坏时间复杂度为 A: O(m) B: O(n) C: O(mn) D: O(m/n)

Man: Look at this baby patting device. It helps the baby fall asleep by patting it. Woman: ______. Man: How Woman: If the baby moved around and the patter patted it on the head, it could injure the baby. A: The possible disadvantage is that it could actually harm the baby. B: There’s a baby doll in it. C: Most of the patting device is made of steel. D: I think the device is big enough for the baby.