Given an undirected tree consisting of n vertices numbered from 1 to n. A frog starts jumping from the vertex 1. In one second, the frog jumps from its current vertex to another unvisited vertex if they are directly connected. The frog can not jump back to a visited vertex. In case the frog can jump to several vertices it jumps randomly to one of them with the same probability, otherwise, when the frog can not jump to any unvisited vertex it jumps forever on the same vertex.
The edges of the undirected tree are given in the array edges, where edges[i] = [fromi, toi] means that exists an edge connecting directly the vertices fromi and toi. Return the probability that after t seconds the frog is on the vertex target.

In new york city at the spring equinox there are 12 hours 8 minutes of daylight. the longest and shortest days of the year very by two hours and 53 minutes from the equinox in this year the equinox falls on march 21 in this task you use trigonometric function to model the hours of daylight hours on certain days of the year in new york city a.what is the independent and dependent variables? b.find the amplitude and the period of the function. c.create a trigonometric function that describes the hours of sunlight for each day of the year. d. graph the function you build in part c. e. use the function you build in part c to find out how many fewer daylight hours february 10 will have than march 21. you may look at the calendar.