1 point If you try to speed up binary search by using multiple threads, the problem is We should assign threads to search each part of the array There is no problem Each iteration depends on the previous iteration 1 point strcpy(target, input); has the following concern: It is too slow there are no issues characters in input that do not fit in target will be written to the memory after the target array there may be a lot of unused space in target 1 point To pass the comparison function cmp with the given prototype as a parameter to qsort, fill in the blank: struct point \{ int x,y; \} int cmp (const void *ptr1, const void *ptr2); int main(void) \{ struct point points[NUM_PTS ] II code to fill in the array qsort(points, NUM_PTS, sizeof(struct point), )