Code in Python: in_outWrite a function "in_out(digraph, vert)" that takes in a directed graph and a vertex as its input, and then returns the in-degree and out-degree of that vertex in the directed graph inthe form of a list with rst entry as the in-degree and second entry as the out-degree.+ Code + MarkdownAfter compiling the above cell, you should be able to compile the following cell and obtain the desired outputs.print (in_out({"A" : ["A", "B", "C"], "B" : ["A"], "C" :in_out({"A" : ["B", "D"], "B" : ["A", "D"], "C" :This should return[3,3] [3,0]["A"]}, "A"),["C", "D"], "D" : []}, "D"))PythonPython

Algorithm : 1. Start 2. Create two variables to store the in and out degrees of the given vertice - in_degree and out_degree. 3. Iterate through the digraph. 4. For each key in the digraph, iterate through its values. 5. If the value is equal to the given vertice, increment in_degree. 6. If the key is equal to the given vertice, set out_degree to the length of the digraph's key's value. 7. Return the in_degree and out_degree. 8. Print the result. 9. EndSource code: #Input paramters are the digraph and the vertex.#The function returns a list with the in_degree at 0th index and out_degree at 1st index.def in_out(digraph, vert):#Initialize the in_degree and out_degree to 0 in_degree = 0 out_degree = 0 #Loop through the digraph for key in digraph: #Loop through the values of the given key for value in digraph[key]: #Increment in_degree if the value is equal to the given vertex if value == vert: in_degree += 1 #Check if the given key is equal to the vertex #If yes, assign out_degree to the length of values of that particular key if key == vert: out_degree = len(digraph[key]) #Return the list containing in_degree and out_degree return [in_degree, out_degree]#Print the in_degree and out_degree of vertex A and D in the given digraphsprint(in_out({"A" : ["A", "B", "C"], "B" : ["A"], "C": ["A"]}, "A"), in_out({"A": ["B", "D"], "B" : ["A", "D"], "C": ["C", "D"], "D" : []}, "D"))Code screenshot:Output: