Regular Language and Finite Automata|| (2 Mark)||NAT||2018

Given a language L, define L i as follows :
L₀ = {ϵ}
L_i = L_i-1 .
L for all i > 0 The order of a language L is defined as the smallest k such that L^k = L^k+1 . Consider the language L₁ (over alphabet 0) accepted by the following automation.

The order of L₁ is _______.

[GATE 2018| NAT|| 2-mark]