Write a pseudo code for Maximal Frequent Candidate generation procedure in pincer search algorithm. During the execution of Pincer-search Algorithm, it is found that when k=1, L1 ={{A} , {B}, {C}, {D, {E} }, Si ={ }, MFCS={A,B,C,D,E} ,MFS={} when k=2, L2={{A,B}, {A,C}, {A,E}, {B,C}, {B,D}, {B,E} } and S2 = {{A,D}, {C,D},{C,E}, {D,E} } Find the following: (i) MFCS, MFS, when k=2 (ii) L2 after MFS pruning (iii) C3 after MFCS Pruning. Indicate all steps