Extra Credit Problem (40pts) If you do this question, separate it into another pdf file and upload it to Canvas/Assignments/HW/Extra Credit item 4. You are in a lab to test n supposedly identical computer chips, which are in principle capable of testing each other. When two chips A and B are tested, if one is working correctly, its test result of the other is accurate. If one is not working correctly, its test result of the other is not necessarily accurate. As a result: chip A Ckip A54ys D SayS ood S 900 " A issad.' , or A rs baol j " ?.is bad.' a. Sood abad A is sav"or Ars ba Assuming that more than n/2 chips are good, you are to identify one good chip with the minimum number of pairwise tests. Develop an algorithm to compute the problem: Input: n chips as above, at least [n/2] of which are good. Output: one good chip Your algorithm is allowed use O(n) pairwise tests in total to determine one good chip. Extra Credit Problem (40pts) If you do this question, separate it into another pdf file and upload it to Canvas/Assignments/HW/Extra Credit item 4. You are in a lab to test n supposedly identical computer chips, which are in principle capable of testing each other. When two chips A and B are tested, if one is working correctly, its test result of the other is accurate. If one is not working correctly, its test result of the other is not necessarily accurate. As a result: chip A Ckip A54ys D SayS ood S 900 " A issad.' , or A rs baol j " ?.is bad.' a. Sood abad A is sav"or Ars ba Assuming that more than n/2 chips are good, you are to identify one good chip with the minimum number of pairwise tests. Develop an algorithm to compute the problem: Input: n chips as above, at least [n/2] of which are good. Output: one good chip Your algorithm is allowed use O(n) pairwise tests in total to determine one good chip