<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with the edge set [(0, 1), (1, 2), (2, 3), (3, 0), (1, 3)] and edge weights [1, 2, 1, 3, 4], can you use the hub_score function in igraph to calculate Kleinberg's hub scores for this graph? Please, normalize the scores so that the largest one is 1 and print them out.
### Response:
import igraph as ig

# Create a directed graph with edge weights
edges = [(0, 1), (1, 2), (2, 3), (3, 0), (1, 3)]
weights = [1, 2, 1, 3, 4]
graph = ig.Graph(edges=edges, directed=True)
graph.es['weight'] = weights

# Calculate Kleinberg's hub scores
hub_scores = graph.hub_score(weights='weight', scale=True, arpack_options=None, return_eigenvalue=False)

# Print the hub scores
print(hub_scores)
<|EOT|>
