A bubble in a de Bruijn graph consists of two parallel paths connecting from the same vertex A to the same vertex B. 1) Devise an algorithm for detecting bubbles in a given de Bruijn Graph. 2) After a bubble is detected, you must decide which of the two paths in the bubble to remove. How should you make this decision? Explain your answer. Note no code is necessary, simply numbered or simple pseudo code will suffice.