Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound