please explain step by step and easy understanding. Thank you for your help. Note$>>>$ I only need answer for No$.3.$ I will provide the question $1$ and $2$ to get the answer No$.3.$ Thank you again.

$1.(4$ points$)$ Design an algorithm for this problem using a Divide and Conquer approach. $($a$)(2$ points$)$ Create a step$-$by$-$step graphical visualization $($i$.$e using diagrams$)$ of your solution for this problem using the following string S $=$"ImaaaGGinat$-$iooOn$0$n is more imppppPP ortanNnnn t t$$ha$$n knnnnow$-$ledge$.$ Students are allowed to hand$-$drawn their solutions for this problem.

$($b$)(2$ points$)$ Create an step$-$by$-$step algorithm for this problem $($in plain english$).$ Your algorithm must work for all the given strings S$,$ including empty strings. In addition, your algorithm must consider all the corner cases that you may encounter in this problem. Neither code nor pseudocode is allowed in this problem

$2.(2$ points$)$ Pseudocode your algorithm from problem $(1)$ part $($b$).$ Note that your pseudocode must be understood also by non$-$technical readers to get credit for this problem, and it must be pseudocoded using the Divide and Conquer approach defined by your algorithm

$(3)$ Implement your pseudocode from problem $(2)$ using your favorite programming language, and provide at least $3$ different unit tests to test the correct output of your code.

Your code should be implemented in an online code editor. I recommend Replit for this task, but you can use a code online editor of your choice for this task. Please share below the invite link to your code hosted on Replit or the online editor of your choice. Note that code directly typed or appended to this document won$$t get credit for this problem.