{ = {0,1,#}, L = {s: s = m#n, m,n e {0,1}*, and when m and n are interpreted as binary natural numbers, m + n = 3*n}. As examples, 10#1 L because 2+1 3*1; 1010#101 e L because 10+5=3*5; 100#111&L because 4+7+ 3*7; s = 1010101 & L because s does not contain #. Use the RL pumping theorem to show that L&RLS