All non-isomorphic CA^*₁(3,2,2)s, the number of runs, a lower bound for D-efficiency and D-efficiency ordering (.n means that the design ranks number n in the D-efficiency ordering):

Covering Array             Number of Runs             Lower Bound and Ordering  
CA^*₁(3,2,2).1                         4                                    (100%).1