Java codeExampleInput:41 1 2 2Output:72 Sereja likes to hang around trees. A tree is an undirected graph on N vertices withN-1 edges and no cycles. Sereja has his own peculiar way of comparing two trees.To describe it, let's start with the way Sereja stores a tree. For every tree, Serejahas a value V– the root of the tree, and for every vertex i, he has an ordered listQ[i] with L[i] elements – Q[i][1], Q[i][2], ..., Q[iLI] which are children of thevertex i. Sereja assumes two trees to be equal if their roots are the same and forevery i, the ordered list Q[i] is the same in both the trees that Sereja compares.So if Sereja has tree#1 given as [V=1, Q[1]=[2, 3], Q[2]=[], Q[3]=0] and tree#2given as [V=1, Q[1]=[3, 2], Q[2]=[], Q[3]=[]], they will be considered differentbecause Q[1] in the first tree is not equal to Q[1] in the second tree.For any vertex İ, Sereja calls number of vertices adjacent to it as E[i).Given an array C of N elements, Let f(C) be the number of different trees (inSereja's representation) such that there exists a permutation P[1], P[2], ... , P[N]so that E[P[1]]=C[1], E[P[2]]= C[2], ... , E[P[N]]=C[N].Sereja gives you the array C. You have to compute the number f(C) modulo1000000007 (109+7).

Name: Java codeExampleInput:41 1 2 2Output:72 Sereja likes to hang around tr
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Java codeExampleInput:41 1 2 2Output:72 Sereja likes to hang around trees. A tree is an undirected graph on N vertices withN-1 edges and no cycles. Sereja has his own peculiar way of comparing two trees.To describe it, let's start with the way Sereja