Hello everyone. I need your help. I have been trying to solve a problem from code chef, and I wonder whether, it is possible to count number of paths with length i for all i in [1..n] on an acyclic undirected graph in O(n*log(n)) time complexity or not. Here, by length of a path I mean the number of nodes the path contains.