LeetC.... DEVOPS He 0 2-4 MathWorks EDG Programming HackerRank Question-Rooted Checkerrank. thidm cours... k.com/test/gitmpk9bp4h/questions/98eqdgoq9pt 7. Rooted Distances Determine the ma Given a tree of tree nodes vertices labeled from 1 to free nodes, each vertex is associated with a value a. We define the beauty of some vertex viwhere of dist vallover all vertices/ ec nodes). Here dal videnotes the number of edges on a where , simple path from/to w Example tree_nodes - 2 tree edges = 1 free from= [1] tree to=[2] de cogniz feeding school of beauty for any vertex For vertex 1. beauty is dis(1, 1)*3+dis(2)| 1)*4=0*314=4 Q Seuch Max U... 3 DEEL 34 6 O 88 AAAAA 5 B Autocon 8