. Not yet and Question 2 (20 marts) 7 worked out of 20.00 SO Firth attempt Given a list of N characters of and where the characters are randomly ordered It is permitted to replace (not swap) any element 'A' by Band vice versa in order to guarantee that there is no any two similar consecutive characters. It is requested to develop an algorithm to do this task with the minimum number of replacements. For example: Input IAB,A,A,B,A,A) Output minimum replacements *3 --> (ARABARA a) Develop your algorithm to do the task with the minimum number of replacement. Noter you have to explain how your algorithm will work) 110 mark b) Analyze its complexity and explain your answer 16 marts e) To which type of problems does this problem bolong, NP, NP-Hora, Comploto? Why? (4 mark