<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def get_top_hubs(graph, *, n: Optional[int] = 15) -> List[Tuple[BaseEntity, int]]: """Get the top hubs in the graph by BEL. :param pybel.BELGraph graph: A BEL graph :param n: The number of top hubs to return. If None, returns all nodes """

    return Counter(dict(graph.degree())).most_common(n=n)