(Solved) : Assignment 2individual Assignment Due Sept 28 10 00am Please Submit Via Canvaslambda Terms Q31311105 . . . .

Assignment 2Individual assignment, due Sept 28 at 10:00am, please submit via canvas.Lambda terms in de Bruijn notation are represented as trees with unary lambda nodes and binary application nodes, with de Bruijn indices (starting at 0) marking their leaf nodes.Write a Python program, that given a lambda term in de Bruijn notation, displays it as a tree.The program must use Python tuples for both our lambda nodes and application nodes.To facilitate testing with easier to read inputs, we define:def l(x) : return (‘l’,x)def a(x,y) : return (‘a’,x,y)As an example, the Python expression l(l(a(a(0,l(3)),a(l(0),0)))) returns the tree(‘l’, (‘l’, (‘a’, (‘a’, 0,