<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges from vertex 0 to 1, 1 to 2, 2 to 3, 3 to 4, 4 to 5, and 3 to 5, can you use the 'authority_score' function in igraph to calculate Kleinberg's authority scores for the vertices of this graph? Please print the authority scores.
### Response:
from igraph import Graph

# Create an example graph with edges
g = Graph([(0, 1), (1, 2), (2, 3), (3, 4), (4, 5), (3, 5)])

# Calculate Kleinberg's authority scores for each vertex
authority_scores = g.authority_score()

# Print the authority scores
print(authority_scores)
<|EOT|>
