给出有向图的邻接矩阵如下：
V1 | V2 | V3 | V4 | V5 | V6 | V7 | V8 | V9 | V10 | |
V1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
V2 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
V3 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 |
V4 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 |
V5 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
V6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 |
V7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 |
V8 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
V9 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
V10 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
（1） 请分别写出V1开始的深度遍历和宽度遍历的结果。根据图邻接矩阵，结点访问顺序按列从左到右，因而该深度遍历和宽度遍历结果都是唯一的。
（2）请给出拓扑排序序列，要求在寻找拓扑排序的各结点时，如果有多种选择那么优先选择结点序号小的结点，根据上述要求，这样的拓扑序列是唯一的
